Abstract
The capacitated multicommodity network design problem presents a major challenge. At the present time, there exists no exact algorithm that can solve large instances, common in several applications, in a reasonable period of time. In these cases, heuristic methods are being used to find near optimal solutions. Some heuristic procedures need initial solutions or a set of initial solutions to start their search. A GRASP is proposed that gives solutions of acceptable quality. In this paper we adapt the GRASP technique including memory features to the mentioned problem, and the results are compared to the same GRASP without these features.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Argüello M.F., Bard J.F., Yu G. (1997). “A GRASP for Aircraft Routing in Response to Groundings and Delays”. Journal of Combinatorial Optimization, Vol 1, 211–228
Balakrishnan A., Magnanti T.L. (1989). “A Dual Ascent Procedure for Large-Scale Uncapacitated Network Design”. Operations Research 37, No. 5, 716–740.
Crainic T.G., Gendreau M., Farvolden J. (2000). “A Simplex-Based Tabu Search Method for Capacitated Network Design”. INFORMS Journal on Computing, Vol. 12, No. 3, 223–236.
Feo, T. A., and Resende M.G.C. (1995) “Greedy Randomized Adaptive Search Procedures”. Journal of Global Optimization, Vol. 6, 109–133
Fernández E., Martí R. (1999). “GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps”. Journal of Heuristics, Vol.5,181–197
Fleurent C., Glover F. (1999). “Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory”. INFORMS Journal on Computing, Vol. 11, No. 2, 198–204
Gendron B., Crainic T.G. (1994). “Relaxations for Multicommodity Capacitated Network Design Problems”, publication CRT-965, Centre de recherche sur les transports, Université de Montréal.
Gendron B., Crainic T.G. (1994). “Parallel Implementations of Bounding Procedures for Multicommodity Capacitated Network Design Problems”, publication CRT-94–45, Centre de recherche sur les transports, Université de Montréal.
Gendron B., Crainic T.G. (1996): “Bounding Procedures for Multicommodity Capacitated Fixed Charge Network Design Problems”, publication CRT-96–06, Centre de recherche sur les transports, Université de Montréal.
Herrmann J.W., Ioannou G., Minis I., Proth J.M. (1996). “A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem”. European Journal of Operational Research 95,476–490.
Hochbaum D.S., Segev A. (1989). “Analysis of a Flow Problem with Fixed Charges”. NETWORKS, Vol. 19, 291–312.
Holmberg K., Di Yuan. (2000). “A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem”. Operations Research, Vol 48, No.3, 461–481.
Holmberg K., Hellstrand J. (1998). “Solving the Uncapacitated Network Design Problem by a Lagrangean heuristic and Branch-and-Bound”. Operations Research 46, No.2, 247–258.
Johnson, D.S., Lenstra J.K., Rinooy A.H.G. (1978). “The Complexity of the Network Design Problem”. NETWORKS, Vol. 8, 279–285.
Magnanti T. et al. (1986). “Tailoring Benders Decomposition for Uncapacitated Network Design”. Mathematical Programming Study 26, 112–154.
Magnanti T., R. Wong (1984). “Network Design and Transportation Planning: Models and Algorithms”. Transportation Science 18, 1–55
Sridhar V., Park J.S. (2000). “Benders-and-cut algorithm for fixed-charge capacitated network design problem”. European Journal of Operational Research 125, 622–632.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
De Alba, K., Alvarez, A., Gonzalez-Velarde, J.L. (2003). Grasp with Adaptive Memory Programming for Finding Good Starting Solutions to the Multicommodity Capacitated Network Design Problem. In: Bhargava, H.K., Ye, N. (eds) Computational Modeling and Problem Solving in the Networked World. Operations Research/Computer Science Interfaces Series, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1043-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1043-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5366-9
Online ISBN: 978-1-4615-1043-7
eBook Packages: Springer Book Archive