Afficher la notice abrégée

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

hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorCLAUTIAUX, François
hal.structure.identifierLaboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
dc.contributor.authorHANAFI, Said
hal.structure.identifierLille économie management - UMR 9221 [LEM]
dc.contributor.authorMACEDO, Rita
hal.structure.identifierCentre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
dc.contributor.authorVOGE, Marie-Emilie
hal.structure.identifierUniversidade do Minho = University of Minho [Braga]
dc.contributor.authorALVES, Cláudio
dc.date.accessioned2024-04-04T02:55:09Z
dc.date.available2024-04-04T02:55:09Z
dc.date.issued2017
dc.identifier.issn0377-2217
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192338
dc.description.abstractEnThis 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.
dc.language.isoen
dc.publisherElsevier
dc.subject.enInteger programming
dc.subject.enCombinatorial optimization
dc.subject.enAggregation of integer models
dc.subject.enArc-flow integer models
dc.subject.enAggregation of integer
dc.title.enIterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
dc.typeArticle de revue
dc.identifier.doi10.1016/j.ejor.2016.09.051
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.journalEuropean Journal of Operational Research
bordeaux.page467 - 477
bordeaux.volume258
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-01410170
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01410170v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=European%20Journal%20of%20Operational%20Research&rft.date=2017&rft.volume=258&rft.spage=467%20-%20477&rft.epage=467%20-%20477&rft.eissn=0377-2217&rft.issn=0377-2217&rft.au=CLAUTIAUX,%20Fran%C3%A7ois&HANAFI,%20Said&MACEDO,%20Rita&VOGE,%20Marie-Emilie&ALVES,%20Cl%C3%A1udio&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée