GRASP with path relinking heuristics for the antibandwidth problem

Networks

Volumn 58, Issue 3, 2011, Pages 171-189

  Duarte, A ^a   Marti R ^b   Resende, M G C ^c   Silva, R M A ^d  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF VALENCIA   (Spain)

^c AT AND T LABS RESEARCH   (United States)

^d FEDERAL UNIVERSITY OF LAVRAS   (Brazil)

Author keywords

antibandwidth; bandwidth; evolutionary path relinking; GRASP; metaheuristics; path relinking

Indexed keywords

ADJACENT NODES; ANTIBANDWIDTH; COMMERCIAL SOLVERS; COMPUTATIONAL RESULTS; GRASP; HIGH-QUALITY SOLUTIONS; LINEAR INTEGER PROGRAMMING; META HEURISTICS; OPTIMALITY; PATH RELINKING; UNDIRECTED GRAPH;

BANDWIDTH;

INTEGER PROGRAMMING;

EID: 80053188683     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20418     Document Type: Article

References (26)

1. D. V. Andrade, M. G. C. Resende, GRASP with evolutionary path-relinking, Proc. of Seventh Metaheuristics International Conference (MIC 2007), Montréal, Canada, 2007.
2. T. A. Feo, M. G. C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper Res Lett 8 (1989), 67-71.
3. T. A. Feo, M. G. C. Resende, S. H. Smith, A greedy randomized adaptive search procedure for maximum independent set, Oper Res 42 (1994), 860-878.
4. N. E. Gibbs, W. G. Poole, P. K. Stockmeyer, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM J Numer Anal 13 (1976), 236-250.
5. F. Glover, Tabu search and adaptive memory programming-Advances, applications and challenges, Interfaces in Computer Science and Operations Research, R. S. Barr, R. V. Helgason, J. L. Kennington, (Editors), Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996, pp. 1-75.
6. F. Glover, M. Laguna, Tabu search, Kluwer Academic Publishers, Norwell, MA, USA, 1997.
7. F. Gortazar, A. Duarte, M. Laguna, R. Martí, Black box Scatter Search for general classes of binary optimization problems, Technical report (2009), Leeds School of Busines, University of Colorado at Boulder.
8. W. K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE, vol. 68, 1980, pp. 1497-1514.
9. M. Laguna, R. Martí, GRASP and path relinking for 2-layer straight line crossing minimization, INFORMS J Comput 11 (1999), 44-52.
10. M. Laguna, R. Martí, Scatter search: Methodology and implementations in C, Kluwer Academic Publishers, Norwell, MA, USA, 2003.
11. J. Y.-T. Leung, O. Vornberger, J. D. Witthoff, On some variants of the bandwidth minimization problem, SIAM J Comput 13 (1984), 650-667. (Pubitemid 15514399)
12. R. Martí, M. Laguna, F. Glover, V. Campos, Reducing the bandwidth of a sparse matrix with tabu search, Eur J Oper Res 135 (2001), 211-220.
13. M. Matsumoto, T. Nishimura, Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Trans Model Comput Simul 8 (1998), 3-30.
14. C. H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976), 263-270.
15. E. Piñana, I. Plana, V. Campos, R. Martí, GRASP and path relinking for the matrix bandwidth minimization, Eur J Oper Res 153 (2004), 200-210.
16. S. Donnelly, G. Isaak, Hamiltonian powers in threshold and arborescent comparability graphs, Discrete Math 202 (1999), 33-44. (Pubitemid 129550418)
17. M. G. C. Resende, C. C. Ribeiro, Greedy randomized adaptive search procedures, Handbook of metaheuristics, F. Glover, G. Kochenberger, (Editors), Kluwer Academic Publishers, Norwell, MA, USA, 2003, pp. 219-250.
18. M. G. C. Resende, C. C. Ribeiro, Greedy randomized adaptive search procedures: Advances and applications, Handbook of metaheuristics, 2nd edition, M. Gendreau, J.-Y. Potvin, (Editors), Springer, 2010, pp. 281-317.
19. M. G. C. Resende, R. F. Werneck, A hybrid heuristic for the p-median problem, J Heuristics 10 (2004), 59-88.
20. M. G. C. Resende, M. Gallego, A. Duarte, R. Martí, GRASP and path relinking for the max-min diversity problem, Comput Oper Res 37 (2010), 498-508.
21. C. C. Ribeiro, I. Rosseti, A parallel GRASP for the 2-path network design problem, Springer, Heidelberg, Germany, 2002.
22. C. C. Ribeiro, I. Rosseti, R. Vallejos, On the use of run time distributions to evaluate and compare stochastic local search algorithms, Engineering stochastic local search algorithms, Lecture Notes in Computer Science, T. Stützl, M. Birattari, H. H. Hoos, (Editors), Vol. 5752, Springer, Brussels, Belgium, 2009, pp. 16-30.
23. E. Rodriguez-Tello, H. Jin-Kao, J. Torres-Jimenez, An improved simulated annealing algorithm for the matrix bandwidth minimization, Eur J Oper Res 185 (2008), 1319-1335. (Pubitemid 47498821)
24. L. Török, I. Vrt'o, Antibandwidth of 3-dimensional meshes, Electron Notes Discrete Math 28 (2007), 161-167.
25. L. Yixun, Y. Jinjiang, The dual bandwidth problem for graphs, J Zhengzhou Univ 35 (2003), 1-5.
26. S. Dobrev, R. Královic, D. Pardubská, L. Török, I. Vrt'o, Antibandwidth and cyclic antibandwidth of Hamming graphs, Electron Notes Discrete Math 34 (2009), 295-300.