A Hybrid Genetic Algorithm for the Quadratic Assignment Problem

Explore this paper's citation graph

Summary

The results of the authors' experiments suggest that CHC combined with TS (CHC+TS), and a TS with elitist backtracking algorithm are able to obtain good near optimal solutions within 0.75% of the best-known solutions of the Quadratic Assignment Problem.

Type
article
Published
2000-07-10
Cited by
44
References
35

Keywords

Tabu search, Backtracking, Quadratic assignment problem, Genetic algorithm, Mathematical optimization

References

Cited by

Related papers