A distance-based selection of parents in genetic algorithms
Metaheuristics
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A fast hybrid genetic algorithm for the quadratic assignment problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A Memetic Heuristic for the Generalized Quadratic Assignment Problem
INFORMS Journal on Computing
Image and Vision Computing
Computers and Operations Research
Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm
International Journal of High Performance Computing and Networking
Multistart tabu search and diversification strategies for the quadratic assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Network crossover performance on NK landscapes and deceptive problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Performance of network crossover on NK landscapes and spin glasses
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Compounded genetic algorithms for the quadratic assignment problem
Operations Research Letters
Subset quadratic assignment problem
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Enhancing the performance of hybrid genetic algorithms by differential improvement
Computers and Operations Research
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem
International Journal of Swarm Intelligence Research
| Hi-index | 0.00 |
In this paper we propose several variants of a new genetic algorithm for the solution of the quadratic assignment problem. We designed a special merging rule for creating an offspring that exploits the special structure of the problem. We also designed a new type of a tabu search, which we term aconcentric tabu search. This tabu search is applied on the offspring before consideration for inclusion in the population. The algorithm provided excellent results for a set of 29 test problems having between 30 and 100 facilities.