An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem

Details An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem

2011-11-05

arxiv.org/abs/1111.1353v1

Computer Science

Neural and Evolutionary Computing

Scientific paper

The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. One of the most powerful and commonly used heuristics to obtain approximations to the optimal solution of the QAP is simulated annealing (SA). We present an efficient implementation of the SA heuristic which performs more than 100 times faster then existing implementations for large problem sizes and a large number of SA iterations.

Affiliated with

Also associated with

No associations

Rating

An efficient implementation of the simulated annealing 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 An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704120