论文信息 - Compounded genetic algorithms for the quadratic assignment problem

Compounded genetic algorithms for the quadratic assignment problem

We introduce the compounded genetic algorithm. We propose to run a quick genetic algorithm several times as Phase 1, and compile the best solutions in each run to create a starting population for Phase 2. This new approach was tested on the quadratic assignment problem with very good results.

Zvi Drezner

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

[2] Zvi Drezner,et al. The extended concentric tabu for the quadratic assignment problem , 2005, Eur. J. Oper. Res..

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

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

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

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

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