Layout method for grouping locations with same relation of distances

Jiro Nagaki; Yoshinari Yanagawa; Shigeji Miyazaki

doi:10.1299/kikaic.62.1204

Layout method for grouping locations with same relation of distances

Jiro Nagaki, Yoshinari Yanagawa, Shigeji Miyazaki

Research output: Contribution to journal › Article › peer-review

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	Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume	62
Issue number	595
DOIs	https://doi.org/10.1299/kikaic.62.1204
Publication status	Published - 1996
Externally published	Yes

ASJC Scopus subject areas

Mechanics of Materials
Mechanical Engineering
Industrial and Manufacturing Engineering

Access to Document

10.1299/kikaic.62.1204

Fingerprint Dive into the research topics of 'Layout method for grouping locations with same relation of distances'. Together they form a unique fingerprint.

Cite this

@article{e3327ab33d654410abb0bad615aedfd4,

title = "Layout method for grouping locations with same relation of distances",

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.",

author = "Jiro Nagaki and Yoshinari Yanagawa and Shigeji Miyazaki",

year = "1996",

doi = "10.1299/kikaic.62.1204",

language = "English",

volume = "62",

pages = "1204--1209",

journal = "Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C",

issn = "0387-5024",

publisher = "Japan Society of Mechanical Engineers",

number = "595",

}

TY - JOUR

T1 - Layout method for grouping locations with same relation of distances

AU - Nagaki, Jiro

AU - Yanagawa, Yoshinari

AU - Miyazaki, Shigeji

PY - 1996

Y1 - 1996

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

U2 - 10.1299/kikaic.62.1204

DO - 10.1299/kikaic.62.1204

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 -