A Genetic Local Search Approach to the Quadratic Assignment Problem

@inproceedings{Merz1997AGL,
  title={A Genetic Local Search Approach to the Quadratic Assignment Problem},
  author={Peter Merz and Bernd Freisleben},
  booktitle={ICGA},
  year={1997}
}
Augmenting genetic algorithms with local search heuristics is a promising approach to the solution of combinatorial optimization problems. In this paper, a genetic local search approach to the quadratic assignment problem (QAP) is presented. New genetic operators for realizing the approach are described, and its performance is tested on various QAP instances containing between 30 and 256 facilities/locations. The results indicate that the proposed algorithm is able to arrive at high quality… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 82 extracted citations

A shared-memory ACO+GA hybrid for combinatorial optimization

2007 IEEE Congress on Evolutionary Computation • 2007
View 12 Excerpts
Highly Influenced

E-Commerce and Web Technologies

Lecture Notes in Computer Science • 2003
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 28 references

QAPLIB - A Quadratic Assignment Problem Library

J. Global Optimization • 1997
View 3 Excerpts
Highly Influenced

Genetic Local Search for the Tsp: New Results

Bernd FreislebenDepartment
1997

Parallel Hybrid MetaHeuristics : Application to the Quadratic Assignment

ProblemV, . Bachelet, +3 authors TalbizFebruary
1996
View 1 Excerpt

A Modification of Threshold Accepting and its Application to the Quadratic Assignment Problem

V. Nissen, H. Paul
OR Spektrum, vol. 17, pp. 205– 210, 1995. • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…