Exact and heuristic approaches for a new circular layout problem
Name
42452_2020_Article_2734.pdf
Size
1.97 MB
Format
Adobe PDF
Checksum (MD5)
ec2b272df38ddf545e18f5ba63a6a7f2
Author(s)
Hungerländer, Philipp
Maier, Kerstin
Pachatz, Veronika
Truden, Christian
Date Issued
May 8, 2020
Publisher
Springer International Publishing
Citation
SN Applied Sciences. 2020 May 08;2(6):1035
Version
Final published version
Abstract
Abstract
We discuss a new facility layout problem, the so-called Directed Circular Facility Layout Problem (DCFLP). The DCFLP aims to find an optimal arrangement of machines on a circular material handling system such that the total weighted sum of the center-to-center distances between all pairs of machines measured in clockwise direction is minimized. Several real-world applications, like for example the optimal arrangement of a set of cutting tools on a tool turret, can be modeled as a DCFLP. Further, the DCFLP generalizes a couple of layout problems that are well-discussed in literature. We show that the DCFLP can be modeled as a Linear Ordering Problem (LOP). Hence, it can be solved efficiently by using exact and heuristic approaches for the LOP. First, we apply a Semidefinite Programming as well as an Integer Linear Programming approach. Moreover, we use a Tabu Search and a Variable Neighborhood Search heuristic, for solving the DCFLP. Finally, we compare the practical performance of our approaches in a computational study.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s42452-020-2734-z
