论文信息 - The extended concentric tabu for the quadratic assignment problem

The extended concentric tabu for the quadratic assignment problem

Abstract In this paper we propose to extend the concentric tabu search for the quadratic assignment problem to include more permissible moves. Two extensions are suggested and tested. The computational comparisons with existing hybrid genetic algorithms provide comparable solutions to the best available algorithms.

Zvi Drezner | Z. Drezner

[1] V. Deineko,et al. The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[2] Bhaba R. Sarker,et al. Discrete location theory , 1991 .

[3] Eranda Çela,et al. The quadratic assignment problem : theory and algorithms , 1999 .

[4] Ashish Tiwari,et al. A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[5] Zvi Drezner,et al. Facility location - applications and theory , 2001 .

[6] Franz Rendl,et al. The Quadratic Assignment Problem , 2002 .

[7] Zvi Drezner,et al. A New Genetic Algorithm for the Quadratic Assignment Problem , 2003, INFORMS J. Comput..

[8] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[9] Zvi Drezner,et al. A new heuristic for the quadratic assignment problem , 2002, Adv. Decis. Sci..

[10] É. Taillard. COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[11] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.