Variable neighborhood search with ejection chains for the antibandwidth problem

Journal of Heuristics

Volumn 18, Issue 6, 2012, Pages 919-938

  Lozano, Manuel ^a   Duarte, Abraham ^b   Gortázar, Francisco ^b   Martí, Rafael ^c  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Layout problems; Metaheuristics; VNS

Indexed keywords

HIGH-QUALITY SOLUTIONS; LAYOUT PROBLEMS; MAXIMIZATION PROBLEM; META HEURISTICS; OPTIMIZATION PROBLEMS; SEPARATION PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH; VNS;

BANDWIDTH; HEURISTIC ALGORITHMS; TABU SEARCH;

INTEGER PROGRAMMING;

EID: 84877065442     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-012-9213-7     Document Type: Article

References (24)

1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8, 343-373 (2002)
2. Bansal, R., Srivastava, K.: Memetic algorithm for the antibandwidth maximization problem. J. Heuristics 17, 39-60 (2011)
3. Burkard, R.E., Donnani, H., Lin, Y., Rote, G.: The obnoxious center problem on a tree. SIAM J. Discret. Math. 14(4), 498-590 (2001)
4. Cappanera, P.: A survey on obnoxious facility location problems. Technical Report TR-99-11, Dipartimento di Informatica, Università di Pisa (1999)
5. Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. J. ACM Comput. Surv. 34(3), 313-356 (2002)
6. Dobrev, S., Královic, R., Pardubská, D., Török, L., Vrt'o, I.: Antibandwidth and cyclic antibandwidth of Hamming graphs. Electron. Notes Discret. Math. 34, 295-300 (2009)
7. Duarte, A., Martí, R., Resende, M.G.C., Silva, R.M.A.: GRASP with path relinking heuristics for the antibandwidth problem. Networks 58(3), 171-189 (2011)
8. Duarte, A., Escudero, L.F., Martí, R., Mladenovic, N., Pantrigo, J.J., Sánchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247-3255 (2012)
9. Glover, F., Laguna, M.: Tabu Search. Kluwer, Norwell (1997)
10. Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497-1514 (1980)
11. Hansen, P., Mladenovic, N., Brimberg, J., Moreno-Pérez, J.A.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn, pp. 61-86. Springer, Heidelberg (2010)
12. Harwell-Boeing: http://math.nist.gov/MatrixMarket/data/Harwell-Boeing/ (2011)
13. Leung, J.Y.-T., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Comput. 13, 650-667 (1984)
14. Martí, R., Duarte, A., Laguna, M.: Advanced scatter search for the max-cut problem. INFORMS J. Comput. 21(1), 26-38 (2009)
15. Miller, Z., Pritikin, D.: On the separation number of a graph. Networks 19, 651-666 (1989)
16. Pantrigo, J.J., Martí, R., Duarte, A., Pardo, E.G.: Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1), 285-304 (2012)
17. Piñana, E., Plana, I., Campos, V., Martí, R.: GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153, 200-210 (2004)
18. Raspaud, A., Schröder, H., Sykora, O., Török, L., Vrt'o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309, 3541-3552 (2009)
19. Rego, C.: Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3), 201-222 (2001)
20. Resende, M., Martí, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37, 498-508 (2010)
21. Rodriguez-Tello, E., Jin-Kao, H., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331-3346 (2008)
22. Török, L., Vrt'o, I.: Antibandwidth of 3-dimensional meshes. Electron. Notes Discret. Math. 28, 161-167 (2007)
23. Yixun, L., Jinjiang, Y.: The dual bandwidth problem for graphs. J. Zhengzhou Univ. 35, 1-5 (2003)
24. Wang, X., Wu, X., Dumitrescu, S.: On explicit formulas for bandwidth and antibandwidth of hypercubes. Discret. Appl. Math. 157(8), 1947-1952 (2009)