Hierarchical iterated local search for the quadratic assignment problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5818 LNCS, Issue , 2009, Pages 115-129

  Hussin, Mohamed Saifullah ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATED LOCAL SEARCH; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; OTHER APPLICATIONS; QUADRATIC ASSIGNMENT PROBLEMS; STOCHASTIC LOCAL SEARCHES;

LEARNING ALGORITHMS; TRAVELING SALESMAN PROBLEM;

TELECOMMUNICATION NETWORKS;

EID: 71049148508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04918-7_9     Document Type: Conference Paper

References (19)

1. Hoos, H.H., Stützle, T.: Stochastic Local Search-Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
2. Louren?co, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321-353. Kluwer Academic Publishers, Norwell (2002)
3. Call for Papers: HM2009: 6th International Workshop on Hybrid Metaheuristics (2009), http://www.diegm.uniud.it/hm2009/
4. Smyth, K., Hoos, H.H., Stützle, T.: Iterated robust tabu search for MAX-SAT. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol.2671, pp. 129-144. Springer, Heidelberg (2003)
5. Cordeau, J.-F., Laporte, G., Pasin, F.: Iterated tabu search for the car sequencing problem. European Journal of Operational Research 191(3), 945-956 (2008)
6. Misevicius, A.: Using iterated tabu search for the traveling salesman problem. Information Technology and Control 32(3), 29-40 (2004)
7. Misevicius, A., Lenkevicius, A., Rubliauskas, D.: Iterated tabu search: an improvement to standard tabu search. Information Technology and Control 35(3), 187-197 (2006)
8. Lozano, M., Garć?a-Mart́?nez, C.: An evolutionary ILS-perturbation technique. In: Blesa,M.J., Blum,C., Cotta, C., Ferńandez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol.5296, pp. 1-15. Springer, Heidelberg (2008)
9. Essafi, I., Mati, Y., Dauz̀ere-P̀eŕez, S.: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research 35(8), 2599-2616 (2008)
10. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23(3), 555-565 (1976)
11. Burkard, R.E., C?ela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Pardalos, P.M., Du, D.Z. (eds.) Handbook of Combinatorial Optimization, vol.2, pp. 241-338. Kluwer Academic Publishers, Dordrecht (1998)
12. Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)
13. Stützle, T.: Iterated local search for the quadratic assignment problem. European Journal of Operational Research 174(1), 1519-1539 (2006)
14. Hansen, P., Mladenovíc, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449-467 (2001)
15. Stützle, T., Fernandes, S.: New benchmark instances for the QAP and the experimental analysis of algorithms. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.3004, pp. 199-209. Springer, Heidelberg (2004)
16. Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3(2), 87-105 (1995)
17. Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17(4-5), 443-455 (1991)
18. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 11-18. Morgan Kaufmann Publishers, San Francisco (2002)
19. Drezner, Z., Hahn, P., Taillard, E.D.: A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Annals of Operations Research 174, 65-94 (2005)