Layout Problems with Reachability Constraint

Michael Stiglmayr ()
Additional contact information
Michael Stiglmayr: University of Wuppertal

A chapter in Operations Research Proceedings 2019, 2020, pp 183-189 from Springer

Abstract: 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.

Keywords: Combinatorial optimization; Network design problem; Maximum leaf spanning tree; Connected dominating set (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_22

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_22

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().