Efficient matheuristics for multicommodity capacitated network design - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year : 2019

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.
No file

Dates and versions

hal-03472597 , version 1 (09-12-2021)

Identifiers

  • HAL Id : hal-03472597 , version 1

Cite

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⟩
23 View
0 Download

Share

Gmail Facebook X LinkedIn More