A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem

Details A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem

2009-12-30

arxiv.org/abs/0912.5473v1

Computer Science

Data Structures and Algorithms

Scientific paper

We develop a variable depth search heuristic for the quadratic assignment problem. The heuristic is based on sequential changes in assignments analogous to the Lin-Kernighan sequential edge moves for the traveling salesman problem. We treat unstructured problem instances of sizes 60 to 400. When the heuristic is used in conjunction with robust tabu search, we measure performance improvements of up to a factor of 15 compared to the use of robust tabu alone. The performance improvement increases as the problem size increases.

Affiliated with

Also associated with

No associations

Rating

A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34198