Abstract
Many previous researches for the Quadratic Assignment Problem (QAP) have been proposed and applied to several layout problems. Tabu Search setting up `tabu list' is one of the effective approaches in these researches. This paper proposes a heuristic method making use of the main features of Tabu Search for QAP. A suboptimal solution should be efficiently obtained by the proposed method which sets up some restricted and forbidden conditions under various situations. The algorithm in this method is coded in C language. Through a numerical example, steps of the algorithm are shown. The effectiveness of obtained solutions is investigated by the computational experiences.
| Original language | English |
|---|---|
| Pages (from-to) | 1204-1209 |
| Number of pages | 6 |
| Journal | Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C |
| Volume | 62 |
| Issue number | 595 |
| Publication status | Published - Mar 1996 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Mechanical Engineering
Cite this
Layout method for grouping locations with same relation of distances. / Nagaki, Jiro; Yanagawa, Yoshinari; Miyazaki, Shigeji.
In: Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, Vol. 62, No. 595, 03.1996, p. 1204-1209.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Layout method for grouping locations with same relation of distances
AU - Nagaki, Jiro
AU - Yanagawa, Yoshinari
AU - Miyazaki, Shigeji
PY - 1996/3
Y1 - 1996/3
N2 - Many previous researches for the Quadratic Assignment Problem (QAP) have been proposed and applied to several layout problems. Tabu Search setting up `tabu list' is one of the effective approaches in these researches. This paper proposes a heuristic method making use of the main features of Tabu Search for QAP. A suboptimal solution should be efficiently obtained by the proposed method which sets up some restricted and forbidden conditions under various situations. The algorithm in this method is coded in C language. Through a numerical example, steps of the algorithm are shown. The effectiveness of obtained solutions is investigated by the computational experiences.
AB - Many previous researches for the Quadratic Assignment Problem (QAP) have been proposed and applied to several layout problems. Tabu Search setting up `tabu list' is one of the effective approaches in these researches. This paper proposes a heuristic method making use of the main features of Tabu Search for QAP. A suboptimal solution should be efficiently obtained by the proposed method which sets up some restricted and forbidden conditions under various situations. The algorithm in this method is coded in C language. Through a numerical example, steps of the algorithm are shown. The effectiveness of obtained solutions is investigated by the computational experiences.
UR - http://www.scopus.com/inward/record.url?scp=0030100827&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030100827&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0030100827
VL - 62
SP - 1204
EP - 1209
JO - Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
JF - Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
SN - 0387-5024
IS - 595
ER -