×

Layout problems with reachability constraint. (English) Zbl 1471.90046

Neufeld, Janis S. (ed.) et al., Operations research proceedings 2019. Selected papers of the annual international conference of the German Operations Research Society (GOR), Dresden, Germany, September 4–6, 2019. Cham: Springer. Oper. Res. Proc., 183-189 (2020).
Summary: 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.
For the entire collection see [Zbl 1468.90005].

MSC:

90B10 Deterministic network models in operations research
90C27 Combinatorial optimization
PDFBibTeX XMLCite
Full Text: DOI