New Simulated Annealing Algorithm for Quadratic Assignment Problem

被引：0

作者：

Ghandeshtani, Kambiz Shojaee ^{[1
]}

Mollai, Nima ^{[2
]}

Seyedkashi, Seyed Mohammad Hosein ^{[3
]}

Neshati, Mohammad Mohsen ^{[4
]}

机构：

[1] Univ Tehran, Dept Elect Engn, Tehran, Iran

[2] Sadjad Inst Higher Educ, Dept Elect Engn, Mashhad, Iran

[3] Tarbiat Modares Univ, Dept Mech Engn, Tehran, Iran

[4] Ferdowsi Univ Mashhad, Dept Elect Engn, Mashhad, Iran

来源：

PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING COMPUTING AND APPLICATIONS IN SCIENCES (ADVCOMP 2010) | 2010年

关键词：

QAP; Simulated annealing; Cooling Schedule; Greedy search; SEARCH ALGORITHM; TABU SEARCH; LAYOUT; OPTIMIZATION; PLACEMENT; QAP;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：87 / 92

页数：6

共 32 条

[1]

Andrew S., 1995, IEEE T PARALL DISTR, V6, P997

[2] ON LOWER BOUNDS FOR A CLASS OF QUADRATIC-0, 1 PROGRAMS [J].