Skip to Main content Skip to Navigation
Journal articles

An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem

Abstract : In this paper we study the Multicommodity Fixed-Charge Network Design problem. We propose an Iterative linear programming-based heuristic for solving this NP hard problem. The proposed heuristics have been tested on the benchmark instances from the literature. The quality of solutions obtained by each of them has been disclosed comparing them with corresponding solutions of the current state-of-the-art heuristics, i.e., Cycle-Based Evolutionary algorithms.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03400755
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 10:34:27 AM
Last modification on : Wednesday, November 3, 2021 - 5:24:21 AM

Links full text

Identifiers

Collections

Citation

Bernard Gendron, Said Hanafi, Raca Todosijević. An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem. IFAC-PapersOnLine, Elsevier, 2016, 49 (12), pp.117-120. ⟨10.1016/j.ifacol.2016.07.560⟩. ⟨hal-03400755⟩

Share

Metrics

Record views

4