Exact approaches for the combined cell layout problem
Article on exact solution approaches for special arrangement problems published
Together with scientists from the University of Mainz and the University of Klagenfurt, Prof. Dr. Anja Fischer and Dr. Mirko Dahlbeck have designed an algorithm that can be used to precisely solve special arrangement problems that occur in factory planning, for example, for medium-sized instances. Corresponding path structures can be found, for example, in layout planning with production islands, in high-bay warehouses or at airports. The basis is the enumeration over all possible assignments of objects to the cells (such as paths or building parts). For a fixed assignment, the arrangement problem decomposes into smaller subproblems that can be solved independently. In the paper, it is shown how the number of cell assignments to be examined can be significantly reduced, which makes it possible to solve the problems accurately in the first place. For example, the new algorithm can be used in factory planning to determine machine arrangements that minimize transportation costs.
The article (https://doi.org/10.1016/j.ejor.2022.04.031) has been published in the "European Journal of Operational Research", one of the leading journals in the field of Operations Research (VHB-JOURQUAL3: A; Scimago Journal Ranking: Q1)