A heuristic method for the multi-story layout problem

DOI10.1016/0377-2217(88)90202-0zbMath0652.90032OpenAlexW2070001070MaRDI QIDQ1107411

Gerald L. Thompson, Bharat K. Kaku, Ilker Baybars

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90202-0

zbMATH Keywords

facility locationheuristicgroupings of facilitiesK-median subroutinelarge layout problemmulti-story setting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (6)

Large-scale layout of facilities using a heuristic hybrid algorithm ⋮ A new mixed integer programming formulation for facility layout design using flexible bays ⋮ A class of genetic algorithms for multiple-level warehouse layout problems ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems ⋮ Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem ⋮ A new simulated annealing algorithm for the facility layout problem

Cites Work

• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• The Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Numerical investigations on quadratic assignment problems
• An Algorithm for the Quadratic Assignment Problem
• The Efficiency of Computer Algorithms for Plant Layout
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: A heuristic method for the multi-story layout problem