Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

Abstract : This paper develops a general solution framework based on aggregation techniques to solve NP-Hard problems that can be formulated as a circulation model with specific side constraints. The size of the extended Mixed Integer Linear Programming formulation is generally pseudo-polynomial. To efficiently solve exactly these large scale models, we propose a new iterative aggregation and disaggregation algorithm. At each iteration, it projects the original model onto an aggregated one, producing an approximate model. The process iterates to refine the current aggregated model until the opti-mality is proved. The computational experiments on two hard optimization problems (a variant of the vehicle routing problem and the cutting-stock problem) show that a generic implementation of the proposed framework allows us to out-perform previous known methods.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01410170
Contributor : François Clautiaux <>
Submitted on : Tuesday, January 31, 2017 - 2:10:18 PM
Last modification on : Friday, July 26, 2019 - 11:58:03 AM
Long-term archiving on : Monday, May 1, 2017 - 2:13:15 PM

File

two_ida.pdf
Files produced by the author(s)

Identifiers

Citation

François Clautiaux, Sa¨ıdsa¨ıd Hanafi, Rita Macedo, Emilie Voge, Cláudio Alves. Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. European Journal of Operational Research, Elsevier, 2017, 258, pp.467 - 477. ⟨10.1016/j.ejor.2016.09.051⟩. ⟨hal-01410170⟩

Share

Metrics

Record views

564

Files downloads

909