By Topic

A guided evolutionary simulated annealing approach to the quadratic assignment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yip, P.P.C. ; Dept. of Electr. Eng. & Appl. Phys., Case Western Reserve Univ., Cleveland, OH ; Pao, Y.-H.

The quadratic assignment problem, one of the classical NP-complete problems, is usually interpreted as a facility layout problem, of which the task is to assign facilities to locations in a manner so as to minimize a total cost function. The complexity of the problem has motivated the development of many approximation procedures. In this paper, the authors present a new approach to the quadratic assignment problem (QAP). The new technique, called guided evolutionary simulated annealing (GESA), is a parallel algorithm. It combines the ideas of simulated evolution and simulated annealing in a novel way. The authors demonstrate the technique using facility layout problems as examples. Simulation results for benchmark problems are reported. The results indicate that the GESA method outperforms other approximation methods

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 9 )