Title :

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

Author(s) :

Clautiaux, François [Auteur]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Hanafi, Said [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Macedo, Rita [Auteur]
Lille économie management - UMR 9221 [LEM]
Voge, Marie-Emilie [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Alves, Cláudio [Auteur]
Universidade do Minho = University of Minho [Braga]

Conference title :

ISCO 2016, International Symposium on Combinatorial Optimization

City :

Vietri sul Mare

Country :

Italie

Start date of the conference :

2016-05

Publication date :

2017-04

HAL domain(s) :

Informatique [cs]

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL