Tabu search based heuristics for multi-floor facility layout

摘要

A pair of two-stage heuristics, GRASP-TS and FAF-TS, for solving the multi- floor facility layout problem are given. In both heuristics, the objective of the first stage is to refine the initial layout based on total inter/intra-floor costs. GRASP/TS applies a GRASP to obtain the initial layout. FAF/TS uses an exact Procedure FAF from the open literature to obtain an initial layout with minimal Inter-floor flow. Computational tests indicate that GRASP/TS compares Favourably with other heuristics that do not rely on exact algorithms. FAF/TS Is shown to outperform all other heuristics in the open literature