New benchmark instances for the QAP and the experimental analysis of algorithms

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

Volumn 3004, Issue , 2004, Pages 199-209

  Stützle, Thomas ^a   Fernandas, Susana ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF ALGARVE   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; OPTIMIZATION;

COMBINATORIAL PROBLEM; COMPUTATIONAL RESULTS; EXACT ALGORITHMS; EXPERIMENTAL ANALYSIS OF ALGORITHMS; HEURISTIC APPROACH; META HEURISTICS; QUADRATIC ASSIGNMENT PROBLEMS; SYSTEMATIC STUDY;

ALGORITHMS;

EID: 33749581467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_20     Document Type: Article

References (24)

1. K. M. Anstreicher, N. W. Brixius, J.-P. Goux, and J. Linderoth. Solving large quadratic assignment problems on computational grids. Mathematical Programming, 91(3):563-588, 2002.
2. R. Battiti and G. Tecchiolli. The reactive tabu search. ORSA Journal on Computing, 6(2):126-140, 1994.
3. N. W. Brixius and K. M. Anstreicher. The Steinberg wiring problem. Technical report, College of Business Administration, University of Iowa, Iowa City, USA, October 2001.
4. R. E. Burkard, E. Çela, P. M. Pardalos, and L. S. Pitsoulis. The quadratic assignment problem. In P. M. Pardalos and D.-Z. Du, editors, Handbook of Combinatorial Optimization, volume 2, pages 241-338. Kluwer Academic Publishers, 1998.
5. E. Çela. The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
6. D. T. Connolly. An improved annealing scheme for the QAP. European Journal of Operational Research, 46(1):93-100, 1990.
7. V.-D. Cung, T. Mautor, P. Michelon, and A. Tavares. A scatter search based approach for the quadratic assignment problem. In T. Baeck, Z. Michalewicz, and X. Yao, editors, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), pages 165-170. IEEE Press, Piscataway, NJ, USA, 1997.
8. Z. Drezner. A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 15(3):320-330, 2003.
9. Z. Drezner, P. Hahn, and É. D. Taillard. A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Annals of Operations Research, to appear.
10. C. Fleurent and J. A. Ferland. Genetic hybrids for the quadratic assignment problem. In P. M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 173-187. American Mathematical Society, Providence, RI, USA, 1994.
11. L. M. Gambardella, É. D. Taillard, and M. Dorigo. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50(2):167-176, 1999.
12. P. Hahn. QAPLIB - a quadratic assignment problem library. http://www.seas.upenn.edu/qaplib/, 2003. Version visited last on 15 September 2003.
13. P. M. Hahn, W. L. Hightower, T. A. Johnson, M. Guignard-Spielberg, and C. Roucairol. Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslavian Journal of Operational Research, 11(1):41-60, 2001.
14. Y. Li, P. M. Pardalos, and M. G. C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P. M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237-261. American Mathematical Society, Providence, RI, USA, 1994.
15. V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4):358-369, 1999.
16. P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation, 4(4):337-352, 2000.
17. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23(3):555-565, 1976.
18. J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2(1):33-45, 1990.
19. T. Stützle. Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, 1999.
20. T. Stützle and M. Dorigo. ACO algorithms for the quadratic assignment problem. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 33-50. McGraw Hill, London, UK, 1999.
21. T. Stützle and H. H. Hoos. MAX-MIN Ant System. Future Generation Computer Systems, 16(8):889-914, 2000.
22. E. D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17(4-5):443-455, 1991.
23. E. D. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3(2):87-105, 1995.
24. E. D. Taillard. FANT: Fast ant system. Technical Report IDSIA-46-98, IDSIA, Lugano, Swiss, 1998.