IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v55y2021i4p930-945.html
   My bibliography  Save this article

Layout Design of Parking Lots with Mathematical Programming

Author

Listed:
  • Konrad Stephan

    (Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, 07743 Jena, Germany)

  • Felix Weidinger

    (Fachgebiet Management Science/Operations Research, Technische Universität Darmstadt, 64289 Darmstadt, Germany)

  • Nils Boysen

    (Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, 07743 Jena, Germany)

Abstract

There is a vivid debate in cities all over the world on how to distribute the restricted space in urban areas among stakeholders. Urban design movements such as new pedestrianism or Copenhagenization advocate that too much space is attributed to cars. In this context, our research investigates the optimization of parking lots with the help of mathematical programming. For the given ground plot of a parking lot, we maximize the number of parking spaces each reachable via a driving lane, so that the urban space attributed to the parking of cars is efficiently used. Based on a grid of squares in which we rasterize the ground plot, this paper presents mixed-integer programs based on three different resolutions for orthogonal parking. Our computational study explores the tradeoff between the additional parking spaces promised by a higher resolution and the increased computational effort because of the larger solution space (and vice versa). We compare our optimization approaches with a sample of 177 real-world parking lots and show that optimization can be a serviceable car park design tool with the help of a case study.

Suggested Citation

  • Konrad Stephan & Felix Weidinger & Nils Boysen, 2021. "Layout Design of Parking Lots with Mathematical Programming," Transportation Science, INFORMS, vol. 55(4), pages 930-945, July.
    • Handle: RePEc:inm:ortrsc:v:55:y:2021:i:4:p:930-945
    DOI: 10.1287/trsc.2021.1049
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1049
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1049?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:55:y:2021:i:4:p:930-945. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.