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

摘要

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.