Home // ADVCOMP 2010, The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences // View article

New Simulated Annealing Algorithm for Quadratic Assignment Problem

Authors:
Kambiz Shojaee Ghandeshtani
Nima Mollai
Seyed Mohammad Hosein Seyedkashi
Mohammad Mohsen Neshati

Keywords: QAP; Simulated annealing; Cooling Schedule; Greedy search.

Abstract:
In facility layout design, the problem of locating facilities with material flow between them was formulated as a Quadratic Assignment Problem (QAP), so that the total cost to move the required material between the facilities is minimized, where the cost is defined by a quadratic function. In this paper, a new definition in cooling scheduling is proposed for simulated annealing algorithm to solve the QAPs. Also a simple greedy-type algorithm is proposed to improve this method. The algorithm is implemented and tested on 40 benchmarks. In comparison with many other recently developed methods, considerable results are obtained by this approach.

Pages: 87 to 92

Copyright: Copyright (c) IARIA, 2010

Publication date: October 25, 2010

Published in: conference

ISSN: 2308-4499

ISBN: 978-1-61208-101-4

Location: Florence, Italy

Dates: from October 25, 2010 to October 30, 2010