Abstract
In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists of a heuristic implementation of the exact Benders-type cutting plane generation method, is proposed. All these algorithms are extensively compared on randomly generated graphs up to 50 nodes and 90 links. It clearly appears that this new Benders-type approach is very promising since it produces the best heuristic solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barahona, F. (1996). “Network Design Using Cut Inequalities.” SIAM Journal on Optimization6(3), 823–837
Bienstock, D., S. Chopra, O. Gunluk, and C. Tsai. (1998). “Minimum Cost Capacity Installation for Multicommodity Network Flows.” Mathematical Programming81, 177–199
Bienstock, D. and O. Gunluk. (1996). “Capacitated Network Design--Polyhedral Structure and Computation INFORMS Journal on Computing243–259
Chopra, S., I. Gilboa, and S. Sastry. (1996). “Algorithms and Extended Formulations for One and Two Facility Network Design.” LNCS1084, 44–57
Dahl, G. and M. Stoer. (1998). “A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems.” INFORMS Journal on Computing10(1), 1–11
Gabrel, V., A. Knippel, and M. Minoux. (1999). “Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions.” Operations Research Letters25, 15–23
Gabrel, V., A. Knippel, and M. Minoux. (2000). “Résolution Exacte de Problèmes d'optimisation de Réseaux Résistants Aux Pannes.” In Proceedings of ALGOTEL 2000
Gabrel, V. and M. Minoux. (1996). “Large Scale LP-Relaxations for Minimum Cost Multicommodity Network FlowProblems with Step-Increasing Cost Functions and Computational Results.” Research Report MASI 96/17, University of Paris 6, France
Gabrel, V. and M. Minoux. (1997). “LP Relaxations Better than Convexification for Multicommodity Network Optimization Problems with Step Increasing Cost Functions.” Acta Mathematica Vietnamica22(1), 123–145
Gunluk, O. (1999). “A Branch-and-Cut Algorithm for Capacitated Network Design Problems.” Math. Prog. Ser A.86, 17–39
Kernighan, B. and S. Lin. (1970). “An Efficient Heuristic Procedure for Partitioning Graphs.” Bell. Systems Tech Journal49(2), 291–307
Knippel, A. (2001). “Modèles et algorithmes de multiflots à coût discontinu pour l'optimisation de réseaux de télécommunications.” PhD thesis, Paris 6 University
Magnanti, T. and P. Mirchandani. (1993). “Shortest Paths, Single Origin-Destination Network Design and Associated Polyhedra.” Networks 33, 103–121
Magnanti, T., P. Mirchandani, and R. Vachani. (1995). “Modeling and Solving the Two-Facility Capacited Network Loading Problem.” Operations Research43(1), 142–157
Minoux, M. (1986). “Network Synthesis and Dynamic Network Optimization.” Annals of Discrete Mathematics31, 283–324
Minoux, M. (1989). “Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications.” Networks19, 313–360
Minoux, M. (2001). “Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods.” Annals of Operations Research106, 19–46
Stoer, M. and G. Dahl. (1994). “A Polyhedral Approach to Multicommodity Survivable Network Design.” Numerische Mathematik68, 149–167
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gabrel, V., Knippel, A. & Minoux, M. A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. Journal of Heuristics 9, 429–445 (2003). https://doi.org/10.1023/B:HEUR.0000004812.23590.a2
Issue Date:
DOI: https://doi.org/10.1023/B:HEUR.0000004812.23590.a2