Skip to main navigation Skip to search Skip to main content

Parking Resource Allocation Optimization Framework Based on a Two-Level Grid Model

  • Haonan Guo
  • , Yun Wang*
  • , Xuedong Yan
  • , Yunlin Guan
  • , Yu Zhou
  • *Corresponding author for this work
  • Beijing Jiaotong University
  • National University of Singapore

Research output: Contribution to journalArticlepeer-review

Abstract

With the rapid increase in vehicle population, solving difficult-to-park and inconvenient-to-park problems has become a necessity for sustainable transportation in major cities. This study investigated the parking resource allocation optimization problem based on a two-level grid model. To address this problem, first users' travel data were matched to the map to obtain the distribution of both parking resources and demands. Second, key demand-supply imbalanced grids were identified. Subsequently, the parking resource allocation optimization problem was formulated as an integer linear programming (ILP) problem aiming to minimize the total cost, including the parking facility construction cost, users' total walking distance, and the penalty for unserved users. Finally, a case study based on real-world data in Cangzhou was conducted to verify the feasibility and effectiveness of the proposed method. The results show that the imbalance between the supply and demand of parking resources can be effectively alleviated.

Original languageEnglish
Article number5977168
JournalJournal of Advanced Transportation
Volume2022
DOIs
StatePublished - 2022
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure
  2. SDG 11 - Sustainable Cities and Communities
    SDG 11 Sustainable Cities and Communities

Fingerprint

Dive into the research topics of 'Parking Resource Allocation Optimization Framework Based on a Two-Level Grid Model'. Together they form a unique fingerprint.

Cite this