Advertisement
Published in:
2020 | OriginalPaper | Chapter
Layout Problems with Reachability Constraint
Author : Michael Stiglmayr
Published in: Operations Research Proceedings 2019
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Many design/layout processes of warehouses, depots or parking lots are subject to reachability constraints, i.e., each individual storage/parking space must be directly reachable without moving any other item/car. Since every storage/parking space must be adjacent to a corridor/street one can alternatively consider this type of layout problem as a network design problem of the corridors/streets.
More specifically, we consider the problem of placing quadratic parking spaces on a rectangular shaped parking lot such that each of it is connected to the exit by a street. We investigate the optimal design of parking lot as a combinatorial puzzle, which has—as it turns out—many relations to classical combinatorial optimization problems.