A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem

Explore this paper's citation graph

Summary

A variable depth search heuristic based on sequential changes in assignments analogous to the Lin-Kernighan sequential edge moves for the traveling salesman problem for the quadratic assignment problem is developed.

Type
preprint
Published
2009-12-30
Cited by
2
References
14
Access
Open access

Keywords

Tabu search, Heuristic, Mathematical optimization, Variable (mathematics), Travelling salesman problem

References

Cited by

Related papers