Article ID: | iaor20051136 |
Country: | Netherlands |
Volume: | 10 |
Issue: | 5 |
Start Page Number: | 525 |
End Page Number: | 545 |
Publication Date: | Sep 2004 |
Journal: | Journal of Heuristics |
Authors: | Crainic Teodor Gabriel, Gendron Bernard, Hernu Genevive |
Keywords: | heuristics |
This paper describes a slope scaling heuristic for solving the multicommodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversification components of the algorithm are essential for the approach to achieve good performance. The computational results on a large set of randomly generated instances from the literature show that the proposed method is competitive with the best known heuristic approaches for the problem. Moreover, it generally provides better solutions on larger, more difficult, instances.