IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i11p4778-d1408423.html
   My bibliography  Save this article

A Graph-Based Scheme Generation Method for Variable Traffic Organization in Parking Lots

Author

Listed:
  • Jing Cao

    (Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai 201804, China)

  • Haichao Ling

    (Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai 201804, China)

  • Tao Li

    (Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai 201804, China)

  • Shiyu Wang

    (Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai 201804, China)

  • Shengchuan Jiang

    (Business School, University of Shanghai for Science and Technology, Shanghai 200093, China)

  • Cong Zhao

    (Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai 201804, China)

Abstract

To deal with the traffic congestion issues caused by the imbalance between supply and demand in parking lots, this study proposes a graph-based scheme generation method for variable traffic organization in parking lots. A graph-based methodological framework is developed to dynamically generate feasible traffic organization schemes and adapt the road networks of parking lots based on fluctuating demands. First, we design a parking lot-tailored enhanced primal approach by adding a directedness attribute while maintaining road continuity to ensure correspondence between generated graphs and traffic organization schemes. A graph generation algorithm is then designed to generate all feasible schemes in the scenario, deploying the depth-first search algorithm to check the connectivity of each graph and narrowing down feasible options based on domain knowledge. Finally, the initial parking space distribution and parking demand are used as inputs to calculate the total vehicle cruising time under each scheme, serving as the key indicator to select the optimal organization scheme. A single-level parking lot model is developed to verify the performance of our method under six initial parking space distributions. This model is built using the multi-agent simulation platform AnyLogic version 8.8.6, which enables the quick transformation of organization schemes by customizing the behavior of different agents. The results show that the optimal organization scheme generated by the proposed method can reduce vehicle cruising time by 15–46% compared to conventional traffic organization, varying according to parking space distributions. The significance of this study lies in its potential to mitigate traffic congestion in parking lots, thereby enhancing overall efficiency and user satisfaction. By dynamically adapting to fluctuating parking demands, this method provides a robust solution for urban planners and parking lot operators aiming to optimize traffic flow and reduce unnecessary delays.

Suggested Citation

  • Jing Cao & Haichao Ling & Tao Li & Shiyu Wang & Shengchuan Jiang & Cong Zhao, 2024. "A Graph-Based Scheme Generation Method for Variable Traffic Organization in Parking Lots," Sustainability, MDPI, vol. 16(11), pages 1-18, June.
  • Handle: RePEc:gam:jsusta:v:16:y:2024:i:11:p:4778-:d:1408423
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/11/4778/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/11/4778/
    Download Restriction: no
    ---><---

    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:gam:jsusta:v:16:y:2024:i:11:p:4778-:d:1408423. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.