Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

JAMDS
2002

favoriteEmaildiscussreport

155views more JAMDS 2002»

A new heuristic for the quadratic assignment problem

13 years 4 months ago

A new heuristic for the quadratic assignment problem

Download www.maths.soton.ac.uk

We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

Zvi Drezner

Real-time Traffic

Heuristic | Heuristic Combines Ideas | JAMDS 2002 | Quadratic Assignment Problem |

claim paper

Related Content

» Microarray Layout as Quadratic Assignment Problem

» Local Optima Networks of the Quadratic Assignment Problem

» An Intensive Search Algorithm for the Quadratic Assignment Problem

» The enhanced evolutionary tabu search and its application to the quadratic assignment prob...

» An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem

» GRASP with PathRelinking for the Quadratic Assignment Problem

» A Hybrid Genetic Algorithm for the Quadratic Assignment Problem

» A GAACOlocal search hybrid algorithm for solving quadratic assignment problem

» Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JAMDS
Authors	Zvi Drezner

Comments (0)