Abstract
A fixed charge capacitated multicommodity network design problem on undirected networks is addressed. At the present time, there exists no algorithm that can solve large instances, common in several applications, in a reasonable period of time. This paper presents an efficient procedure using a scatter search framework. Computational experiments on a large set of randomly generated problems show that this procedure is capable of finding good solutions to large-scale problems within a reasonable amount of time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alvarez, A., J.L. González-Velarde, and K. De Alba. (2001). “Scatter Search for the Multicommodity Capacited Network Design Problem.” In Proceedings of 6th Annual International Conference on Industrial Engineering—Theory, Aplications and Practice. San Francisco, CA, USA.
Balakrishnan A. and T.L. Magnanti. (1989). “A Dual Ascent Procedure for Large-Scale Uncapacitated Network Design.” Operations Research 37(5), 716–740.
Campos V., M. Laguna, and R. Martí. (1999). “Scatter Search for the Linear Ordering Problem.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. New York, USA: McGraw-Hill. pp. 331–339.
CPLEX Optimization, Inc. (1999). ILOG CPLEX 7.1 Reference Manual. Incline Village, NV, USA.
Crainic, T.G. (2000). “Service Network Design in Freight Transportation.” European Journal of Operational Research 122(2), 272–288.
Crainic, T.G., M. Gendreau, and J. Farvolden. (2000). “A Simplex-Based Tabu Search Method for Capacitated Network Design.” INFORMS Journal on Computing 12(3), 223–236.
Cobos, N. (To appear), Tabu Search-Based Algorithm for the Capacitated Network Design Problem. Master in Science Thesis. Universidad Autónoma de Nuevo León, Monterrey, N.L. Mexico.
De Alba, K., A. Alvarez, and J.L. González-Velarde. (2003). “Grasp with Adaptive Memory Programming for Finding Good Starting Solutions to the Multicommodity Capacitated Network Design Problem.” In H.K. Bhargava and N. Ye (eds.), Computational Modeling and Problem Solving in the Networked World. Interfaces in Computer Science and Operations Research. Kluwer, pp. 121–137.
Feo, T.A. and M.G.C. Resende. (1995). “Greedy Randomized Adaptive Search Procedures.” Journal of Global Optimization 6(2), 109–133.
Fleurent, C. and F. Glover. (1999). “Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory.” INFORMS Journal on Computing 11(2), 198–204.
Gendron, B. (2002). A Note on “A Dual-Ascent Approach to the Fixed-Charge Capacitated Network Design Problems.” European Journal of Operational Research 138(3), 671–675.
Gendron, B. and T.G. Crainic (1996). “Bounding Procedures for Multicommodity Capacitated Fixed Charge Network Design Problems. CRT-96-06. Centre de Recherche sur le Transport, Université de Montréal, Montréal, Canada, January.
Gendron, B. and T.G. Crainic. (1994a). “Parallel Implementations of Bounding Procedures for Multicommodity Capacitated Network Design Problems.” CRT-94-45. Centre de Recherche sur le Transport, Université de Montréal, Montréal, Canada, September.
Gendron, B. and T.G. Crainic. (1994b). “Relaxations for Multicommodity Capacitated Network Design Problems.” CRT-965. Centre de Recherche sur le Transport, Université de Montréal, Montréal, Canada, February.
Glover, F. (1998). “A Template for Scatter Search and Path Relinking.” In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution: Third European Conference, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, Heidelberg, Germany, Vol. 1363, pp. 13–54.
Herrmann, J.W., G. Ioannou, I. Minis, and J.M. Proth. (1996). “A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem.” European Journal of Operational Research 95(4), 476–490.
Holmberg, K. and J. Hellstrand. (1998). “Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.” Operations Research 46(2), 247–258.
Holmberg, K. and D. Yuan. (2000). “A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.” Operations Research 48(3), 461–481.
Laguna, M. (2002). “Scatter Search.” In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford Academic Press pp. 183–193.
Laguna, M. and V.A. Armentano. (2004). “Lessons from Applying and Experimenting with Scatter Search.” In C. Rego and A. Bahram (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search (to appear).
Laguna, M. and R. Martí. (2003). “Scatter Seach Metodology and Implemetations in C.” Boston, USA: Kluwer.
Le Pape, L.P., J. Régin, and P. Shaw. (2002). “Robust and Parallel Solving of a Network Design Problem.” In P. Van Hentenryck (ed.), CP 2002, LNCS 2470, Germany: Springer, Heidelberg, pp. 633–648.
Magnanti, T., P. Mireault, and R. Wong. (1986). “Tailoring Benders Decomposition for Uncapacitated Network Design.” Mathematical Programming Study 26, 112–154.
Magnanti, T. and R. Wong. (1984). “Network Design and Transportation Planning: Models and Algorithms.” Transportation Science 18(1), 1–55.
Martí, R., H. Lourenço, and M. Laguna. (2000). “Assigning Proctors to Exams with Scatter Search.” In M.Y. Laguna, J.L. González-Velarde (eds.), Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research. Boston, USA: Kluwer, pp. 215–227.
Sridhar, V. and J.S. Park. (2000). “Benders-and-Cut Algorithm for Fixed-Charge Capacitated Network Design Problem.” European Journal of Operational Research 125(3), 622–632.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alvarez, A.M., González-Velarde, J.L. & De-Alba, K. Scatter Search for Network Design Problem. Ann Oper Res 138, 159–178 (2005). https://doi.org/10.1007/s10479-005-2451-4
Issue Date:
DOI: https://doi.org/10.1007/s10479-005-2451-4