GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem

Journal of Heuristics

Volumn 15, Issue 2, 2009, Pages 133-151

  Martins, Alexandre X ^a   De Souza, Mauricio C ^b   Souza, Marcone J F ^a   Toffolo, Túlio A M ^b  

^a FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

GRASP; Local search; Multi level capacitated minimum spanning tree problem; Network design; Subproblem optimization

Indexed keywords

GRASP; LOCAL SEARCH; MULTI-LEVEL CAPACITATED MINIMUM SPANNING TREE PROBLEM; NETWORK DESIGN; SUBPROBLEM OPTIMIZATION;

BENCHMARKING; DECISION TREES; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION; QUERY PROCESSING;

INTEGER PROGRAMMING;

EID: 64549103828     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-008-9079-x     Document Type: Conference Paper

References (28)

1. Ahuja, R.V., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. R.K. Ahuja J.B. Orlin D. Sharma 2001 Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem Math. Program. 91 71 97
3. A. Amberg W. Domschke S. Voss 1996 Capacitated minimum spanning tree: Algorithms using intelligent search Comb. Optim.: Theory Pract. 1 9 40
4. D. Berger B. Gendron J.Y. Potvin S. Raghavan P. Soriano 2000 Tabu search for a network loading problem with multiple facilities J. Heuristics 6 253 267
5. J. Brimberg P. Hansen K.-W. Lih N. Mladenović M. Breton 2003 An oil pipeline design problem Oper. Res. 51 228 239
6. 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)
7. E. Falkenauer 1996 A hybrid grouping genetic algorithm for bin packing J. Heuristics 2 5 30
8. L.R. Esau K.C. Williams 1966 On teleprocessing system design IBM Syst. J. 5 142 147
9. T.A. Feo M.G.C. Resende 1995 Greedy randomized adaptive search procedures J. Glob. Optim. 6 109 133
10. 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)
11. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. AT&T Labs Research Technical Report, TD-5WYSEW (2004)
12. 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)
13. 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)
14. I. Gamvros B.L. Golden S. Raghavan 2006 The multi-level capacitated minimum spanning tree INFORMS J. Comput. 18 348 365
15. B. Gavish 1982 Topological design of centralized computer networks: Formulations and algorithms Networks 12 355 377
16. B. Gavish 1991 Topological design of telecommunication networks-local access design methods Ann. Oper. Res. 33 17 71
17. L. Gouveia 1995 A 2n formulation for the capacitated minimal spanning tree problem Oper. Res. 43 130 141
18. L. Gouveia P. Martins 2000 A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem Networks 35 1 16
19. L. Gouveia P. Martins 2005 The capacitated minimum spanning tree problem: revisiting hop-indexed formulations Comput. Oper. Res. 32 2435 2452
20. L. Hall 1996 Experience with a cutting plane approach for the capacitated spanning tree problem INFORMS J. Comput. 8 219 234
21. P. Martins 2007 Enhanced second order algorithm applied to the capacitated minimum spanning tree problem Comput. Oper. Res. 34 2495 2519
22. 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)
23. C. Papadimitriou 1978 The complexity of the capacitated tree problem Networks 8 217 230
24. Raghavan, S.: Personal communication, 2007
25. 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)
26. B. Rothfarb M. Goldstein 1971 The one-terminal telpak problem Oper. Res. 19 156 169
27. Y. Sharaiha M. Gendreau G. Laporte I. Osman 1997 A tabu search algorithm for the capacitated shortest spanning tree problem Networks 29 161 171
28. E. Uchoa R. Fukasawa J. Lysgaard A. Pessoa M. Poggi de Aragão D. Andrade 2008 Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation Math. Program. 112 443 472