• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Iterative aggregation and disaggregation ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Article dans une revue scientifique
DOI :
10.1016/j.ejor.2016.09.051
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] refId
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Alves, Cláudio [Auteur]
Universidade do Minho = University of Minho [Braga]
Journal title :
European Journal of Operational Research
Pages :
467 - 477
Publisher :
Elsevier
Publication date :
2017
ISSN :
0377-2217
English keyword(s) :
Integer programming
Combinatorial optimization
Aggregation of integer models
Arc-flow integer models
Aggregation of integer
HAL domain(s) :
Informatique [cs]/Recherche opérationnelle [cs.RO]
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
Files
Thumbnail
  • https://hal.inria.fr/hal-01410170v2/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/hal-01410170v2/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/hal-01410170v2/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017