Advertisement

A GRASP Heuristic for the Capacitated Minimum Spanning Tree Problem Using a Memory-Based Local Search Strategy

  • Mauricio C. de Souza
  • Christophe Duhamel
  • Celso C. Ribeiro
Part of the Applied Optimization book series (APOP, volume 86)

Abstract

We describe a new neighborhood structure for the capacitated minimum spanning tree problem. This neighborhood structure is used by a local search strategy, leading to good trade-offs between solution quality and computation time. We also propose a GRASP with path-relinking heuristic. It uses a randomized version of a savings heuristic in the construction phase and an extension of the above local search strategy, incorporating some short term memory elements of tabu search. Computational results on benchmark problems illustrate the effectiveness of this approach, which is competitive with the best heuristics in the literature in terms of solution quality. The GRASP heuristic using a memory-based local search strategy improved the best known solution for some of the largest benchmark problem.

Keywords

Capacitated minimum spanning tree Metaheuristics GRASP Local search Neighborhood reduction Short term memory Path-relinking. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. R.K. Ahuja, J.B. Orlin, and D. Sharma. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91: 71–97, 2001.MathSciNetzbMATHGoogle Scholar
  2. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with pathrelinking for the three-index assignment problem. Technical report, ATamp;T Labs-Research, Florham Park, NJ, 2000. To appear in INFORMS J. on Computing.Google Scholar
  3. A. Amberg, W. Domschke, and S. Voss. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1: 9–40, 1996.Google Scholar
  4. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with perturbations for the prize-collecting steiner tree problem in graphs. Networks, 38: 50–58, 2001.MathSciNetzbMATHCrossRefGoogle Scholar
  5. K.M. Chandy and T. Lo. The capacitated minimum spanning tree. Networks, 3: 173–181, 1973.MathSciNetzbMATHCrossRefGoogle Scholar
  6. K.M. Chandy and R.A. Russel. The design of multipoint linkages in a telepro- cessing tree network. IEEE Transactions on Computers, 21: 1062–1066, 1972.CrossRefGoogle Scholar
  7. L.R. Esau and K.C. Williams. On teleprocessing system design. IBM Systems Journal, 5: 142–147, 1966.CrossRefGoogle Scholar
  8. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109–133, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  9. P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 325–367. Kluwer, 2002.Google Scholar
  10. B. Gavish. Topological design of centralized computer networks: Formulations and algorithms. Networks, 12: 355–377, 1982.MathSciNetzbMATHCrossRefGoogle Scholar
  11. B. Gavish. Formulations and algorithms for the capacitated minimal directed tree problem. Journal of the ACM, 30: 118–132, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  12. E Glover. Tabu search and adaptive memory programing — Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1–75. Kluwer, 1996.Google Scholar
  13. F. Glover. Multi-start and strategic oscillation methods — Principles to exploit adaptive memory. In M. Laguna and J.L. Gonzales-Velarde, editors, Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pages 1–24. Kluwer, 2000.Google Scholar
  14. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.Google Scholar
  15. F. Glover, M. Laguna, and R. Marti. Fundamentals of scatter search and path relinking. Control and Cybernetics, 39: 653–684, 2000.MathSciNetGoogle Scholar
  16. L. Gouveia. A 2n formulation for the capacitated minimal spanning tree problem. Operations Research, 4: 130–141, 1995.MathSciNetCrossRefGoogle Scholar
  17. L. Gouveia and P. Martins. The capacitated minimum spanning tree problem: An experiment with a hop-indexed model. Annals of Operations Research, 86: 271–294, 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  18. L. Gouveia and P. Martins. A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Networks, 35: 1–16, 2000.MathSciNetzbMATHCrossRefGoogle Scholar
  19. L. Hall. Experience with a cutting plane approach for the capacitated spanning tree problem. INFORMS Journal on Computing, 8: 219–234, 1996.zbMATHCrossRefGoogle Scholar
  20. J.B. Kruskal. On the shortest spanning tree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, volume 7, pages 48–50, 1956.Google Scholar
  21. M. Laguna and R. Marti. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11: 44–52, 1999.zbMATHCrossRefGoogle Scholar
  22. K. Malik and G. Yu. A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks, 23: 525–532, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  23. P. Martins. Problema da ârvore de suporte de custo minimo com restriçâo de capacidade: Formulaçöes corn Indice de navel. PhD thesis, Departamento de Estatistica e Investigaçäo Operacional, Universidade de Lisboa, 1999.Google Scholar
  24. P. Martins, 2001. Personal communication.Google Scholar
  25. C. Papadimitriou. The complexity of the capacitated tree problem. Networks, 8: 217–230, 1978.MathSciNetCrossRefGoogle Scholar
  26. M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for permanent virtual circuit routing. Networks, 41: 104–114, 2003.MathSciNetzbMATHCrossRefGoogle Scholar
  27. M.G.C. Resende and C.C. Ribeiro. Greedy Randomized Adaptive Search Procedures. In E Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219–249. Kluwer, 2003.Google Scholar
  28. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the steiner problem in graphs. INFORMS Journal on Computing, 14: 228–246, 2002.MathSciNetzbMATHCrossRefGoogle Scholar
  29. Y. Sharaiha, M. Gendreau, G. Laporte, and I. Osman. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29: 161–171, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  30. P.M. Thompson and J.B. Orlin. The theory of cyclic transfer. Technical Report OR200–89, MIT, Operations Research Center, 1989.Google Scholar
  31. P.M. Thompson and H.N. Psaraftis. Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Operations Research, 41: 935–946, 1993.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Mauricio C. de Souza
    • 1
  • Christophe Duhamel
    • 1
  • Celso C. Ribeiro
    • 2
  1. 1.LIMOSUniversité Blaise PascalAubière CedexFrance
  2. 2.Department of Computer ScienceCatholic University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations