Layout Method for Grouping Locations with Same Relation of Distances.
Jiro Nagaki, Yoshinari Yanagawa, Shigeji Miyazaki · TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C · 1996
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.