Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

Authors:
Zvi Drezner
Affiliations:
College of Business and Economics, California State University, Fullerton, CA 92834, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 10
Cited 8

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
A genetic approach to the quadratic assignment problem

Computers and Operations Research - Special issue on genetic algorithms
A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A New Genetic Algorithm for the Quadratic Assignment Problem

INFORMS Journal on Computing
A distance-based selection of parents in genetic algorithms

Metaheuristics
A tabu search algorithm for the quadratic assignment problem

Computational Optimization and Applications
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

Informatica
Paper: Robust taboo search for the quadratic assignment problem

Parallel Computing
Compounded genetic algorithms for the quadratic assignment problem

Operations Research Letters

Computing minimal doubly resolving sets of graphs

Computers and Operations Research
Effective formulation reductions for the quadratic assignment problem

Computers and Operations Research
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
Generic hardness estimation using fitness and parameter landscapes applied to robust taboo search and the quadratic assignment problem

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem

Information Sciences: an International Journal
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Enhancing the performance of hybrid genetic algorithms by differential improvement

Computers and Operations Research

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we perform extensive computational experiments solving quadratic assignment problems using various variants of a hybrid genetic algorithm. We introduce a new tabu search (simple tabu). We compared the modified robust tabu and the simple tabu as improvement algorithms in a hybrid genetic algorithm with other tabu searches (concentric tabu, ring moves, all moves, robust tabu) with superior results. We also tested several modifications of the hybrid genetic algorithm and all of them produced good results.