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
- OpenAlex
- https://openalex.org/W18536736
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9094380
Keywords
Tabu search, Heuristic, Mathematical optimization, Variable (mathematics), Travelling salesman problem
References
- Recent advances in the solution of quadratic assignment problems
- QAPLIB – A Quadratic Assignment Problem Library
- Robust taboo search for the quadratic assignment problem
- A Tabu Search Algorithm for the Quadratic Assignment Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem
- Probability Distribution of Solution Time in GRASP: An Experimental Investigation
- Assignment Problems and the Location of Economic Activities
- The Quadratic Assignment Problem: Theory and Algorithms
- GRASP with Path-Relinking for the Quadratic Assignment Problem
- The Quadratic Assignment Problem: A Survey and Recent Developments
Cited by
Related papers
- Heuristic Function to Solve The Generalized Covering TSP with Artificial Intelligence Search
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- A Study on the Heuristic Search Algorithm on Graph
- Searching for Real-Time Heuristic Search Algorithms
- Search Reduction through Conservative Abstract-Space Based Heuristic
- A Multi-Heuristic Search-based Motion Planning for Automated Parking
- Nested Search versus Limited Discrepancy Search
- R* Search