Skip to Main content Skip to Navigation
Conference papers

Efficient matheuristics for multicommodity capacitated network design

Abstract : We present matheuristics for the multicommodity capacitated fixed-charge network design problem (MCND). The matheuristics are based on combining iterative linear programming (ILP) methods and slope scaling (SS) heuristics. Each iteration alternates between solving a linear program obtained by adding pseudo-cuts and a restricted mixed-integer programming (MIP) model. The SS heuristic is used as a warm start to a state-of-the-art generic method that solves the restricted MIP model. The resulting ILP/SS matheuristics are compared against state-of-theart heuristics for the MCND on a set of large-scale difficult instances.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03472597
Contributor : Marie Zoia Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2021 - 2:05:00 PM
Last modification on : Tuesday, January 4, 2022 - 6:00:52 AM

Identifiers

  • HAL Id : hal-03472597, version 1

Collections

Citation

Bernard Gendron, Said Hanafi, Raca Todosijević. Efficient matheuristics for multicommodity capacitated network design. Journées de l’Optimisation / Optimization Days, 2019, Montréal, Canada. ⟨hal-03472597⟩

Share

Metrics

Les métriques sont temporairement indisponibles