Variable neighborhood search with permutation distance for QAP

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

Volumn 3684 LNAI, Issue , 2005, Pages 81-88

  Zhang, Chong ^a   Lin, Zhangang ^a   Lin, Zuoquan ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; NUMERICAL METHODS; OPTIMIZATION; SEARCH ENGINES;

METAHEURISTICS; PERMUTATION DISTANCE; QAP;

COMBINATORIAL CIRCUITS;

EID: 33745296707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554028_12     Document Type: Conference Paper

References (22)

1. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23 (1976) 555-565
2. Taillard, E., Gambardella, L.M.: Adaptive memories for the quadratic assignment problems. Technical Report IDSIA-87-97, Dalle Molle Institute for Artificial Intelligence (1997)
3. Burkard, R.E., Karisch, S., Rendl, F.: Qaplib - a quadratic assignment problem library. European Journal of Operational Research 55 (1991) 115-119
4. Cela, E.: The Quadratic Assignment Problem. Volume 1 of Combinatorial Optimizaiton. Kluwer Academic Publishers (1998)
5. Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 30 (2005) 95-111
6. Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
7. Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50 (1999) 167-176
8. Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Generation Computer Systems 17 (2001) 441-449
9. Maniezzo, V., Colorni, A., Dorigo, M.: The ant system applied to the quadratic assignment. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 11 (1999) 769-778
10. Misevicius, A.: An improved hybrid genetic algorithm: new results for the quadratic assignment problem. KNOWLEDGE-BASED SYSTEMS 17 (2004) 65-73
11. OLIVEIRA, C.A., PARDALOS, P.M., RESENDE, M.: Grasp with path-relinking for the quadratic assignment problem. EXPERIMENTAL AND EFFICIENT ALGORITHMS LECTURE NOTES IN COMPUTER SCIENCE 3059 (2004) 356-368
12. Misevicius, A.: A modified simulated annealing algorithm for the quadratic assignment problem. INFORMATICA 14 (2003) 497-514
13. Mills, P., Tsang, E., Ford, J.: Applying an extended guided local search to the quadratic assignment problem. ANNALS OF OPERATIONS RESEARCH 118 (2003) 121-135
14. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
15. Hansen, P., Mladenović, N.: Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
16. Hansen, P., Mladenović, N. Handbook of Metaheuristics. In: Variable Neighborhood Search. Kluwer Academic Publishers (2003) 621-757
17. García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. Journal of Heuristics 8 (2002) 375-388
18. Mladenovic, N., Labbé, M., Hansen, P.: Solving the p-center problem with tabu search and variable neighborhood search. NETWORKS 42 (2003) 48-64
19. Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 151 (2003) 379-388
20. Bräysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS JOURNAL ON COMPUTING 15 (2003) 347-368
21. Bouthillier, A.L., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. COMPUTERS AND OPERATIONS RESEARCH 32 (2005) 1685-1708
22. Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 160 (2005) 416-422