Abstract
We propose a GRASP using an hybrid heuristic-subproblem optimization approach for the Multi-Level Capacitated Minimum Spanning Tree (MLCMST) problem. The motivation behind such approach is that to evaluate moves rearranging the configuration of a subset of nodes may require to solve a smaller-sized MLCMST instance. We thus use heuristic rules to define, in both the construction and the local search phases, subproblems which are in turn solved exactly by employing an integer programming model. We report numerical results obtained on benchmark instances from the literature, showing the approach to be competitive in terms of solution quality. The proposed GRASP have in fact improved the best known upper bounds for almost all of the considered instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R.V., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71–97 (2001)
Amberg, A., Domschke, W., Voss, S.: Capacitated minimum spanning tree: Algorithms using intelligent search. Comb. Optim.: Theory Pract. 1, 9–40 (1996)
Berger, D., Gendron, B., Potvin, J.Y., Raghavan, S., Soriano, P.: Tabu search for a network loading problem with multiple facilities. J. Heuristics 6, 253–267 (2000)
Brimberg, J., Hansen, P., Lih, K.-W., Mladenović, N., Breton, M.: An oil pipeline design problem. Oper. Res. 51, 228–239 (2003)
de Souza, M.C., Duhamel, C., Ribeiro, C.C.: A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy. In: Resende, M.G.C., De Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making, pp. 627–657. Kluwer Academic, Dordrecht (2003)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2, 5–30 (1996)
Esau, L.R., Williams, K.C.: On teleprocessing system design. IBM Syst. J. 5, 142–147 (1966)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)
Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 325–367. Kluwer Academic, Dordrecht (2001)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. AT&T Labs Research Technical Report, TD-5WYSEW (2004)
Gamvros, I., Raghavan, S., Golden, B.L.: An evolutionary approach for the multi-level capacitated minimum spanning tree. Technical Research Report TR 2002-18, Institute for Systems Research, University of Maryland (2002)
Gamvros, I., Raghavan, S., Golden, B.L.: An evolutionary approach for the multi-level capacitated minimum spanning tree. In: Anandalingam, G., Raghavan, S. (eds.) Telecommunications Network Design and Management, pp. 99–124. Kluwer Academic, Dordrecht (2003)
Gamvros, I., Golden, B.L., Raghavan, S.: The multi-level capacitated minimum spanning tree. INFORMS J. Comput. 18, 348–365 (2006)
Gavish, B.: Topological design of centralized computer networks: Formulations and algorithms. Networks 12, 355–377 (1982)
Gavish, B.: Topological design of telecommunication networks-local access design methods. Ann. Oper. Res. 33, 17–71 (1991)
Gouveia, L.: A 2n formulation for the capacitated minimal spanning tree problem. Oper. Res. 43, 130–141 (1995)
Gouveia, L., Martins, P.: A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Networks 35, 1–16 (2000)
Gouveia, L., Martins, P.: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Comput. Oper. Res. 32, 2435–2452 (2005)
Hall, L.: Experience with a cutting plane approach for the capacitated spanning tree problem. INFORMS J. Comput. 8, 219–234 (1996)
Martins, P.: Enhanced second order algorithm applied to the capacitated minimum spanning tree problem. Comput. Oper. Res. 34, 2495–2519 (2007)
Martins, A.X., Souza, M.J.F., de Souza, M.C.: Modelos matemáticos para o problema da árvore geradora mínima capacitada em níveis. In: Anais do XXXVII Simpósio Brasileiro de Pesquisa Operacional, pp. 1971–1982. Gramado, Brazil (2005) (in Portuguese)
Papadimitriou, C.: The complexity of the capacitated tree problem. Networks 8, 217–230 (1978)
Raghavan, S.: Personal communication, 2007
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbooks of Metaheuristics, pp. 219–249. Kluwer Academic, Dordrecht (2003)
Rothfarb, B., Goldstein, M.: The one-terminal telpak problem. Oper. Res. 19, 156–169 (1971)
Sharaiha, Y., Gendreau, M., Laporte, G., Osman, I.: A tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29, 161–171 (1997)
Uchoa, E., Fukasawa, R., Lysgaard, J., Pessoa, A., Poggi de Aragão, M., Andrade, D.: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math. Program. 112, 443–472 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martins, A.X., de Souza, M.C., Souza, M.J.F. et al. GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J Heuristics 15, 133–151 (2009). https://doi.org/10.1007/s10732-008-9079-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-008-9079-x