Iterative aggregation and disaggregation ...
Type de document :
Communication dans un congrès avec actes
Titre :
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
Auteur(s) :
Clautiaux, François [Auteur]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
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]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
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]
Titre de la manifestation scientifique :
ISCO 2016, International Symposium on Combinatorial Optimization
Ville :
Vietri sul Mare
Pays :
Italie
Date de début de la manifestation scientifique :
2016-05
Date de publication :
2017-04
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :