Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China
Sharing unused private parking spaces with public travelers can improve parking resource utilization. However, a challenge lies in the approach to maximize the utilization of such parking resources without time colliding with the needs of these resources between public travelers and owners over time...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-03-01
|
Series: | Transportation Research Interdisciplinary Perspectives |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2590198221000245 |
id |
doaj-9282c4fe1a4d4955a1f1494fff6cafa9 |
---|---|
record_format |
Article |
spelling |
doaj-9282c4fe1a4d4955a1f1494fff6cafa92021-03-25T04:31:52ZengElsevierTransportation Research Interdisciplinary Perspectives2590-19822021-03-019100317Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, ChinaPengfei Zhao0Hongzhi Guan1Heng Wei2Shixu Liu3School of Civil and Transportation Engineering, Beijing University of Civil Engineering and Architecture, Beijing 102616, China; Corresponding author at: No.15, Yongyuan Road, Huangcun Town, Daxing District, Beijing, 102616, China.College of Architecture and Civil Engineering, Faculty of Urban Construction, Beijing University of Technology, Beijing 100124, ChinaART-EngineS Transportation Research Laboratory, Department of Civil and Architectural Engineering and Construction Management, The University of Cincinnati, Cincinnati, OH 45221-0071, United StatesCollege of Civil Engineering, Fuzhou University, Fuzhou 350116, ChinaSharing unused private parking spaces with public travelers can improve parking resource utilization. However, a challenge lies in the approach to maximize the utilization of such parking resources without time colliding with the needs of these resources between public travelers and owners over time. To address this challenge, this study presents a methodology aiming at efficiently obtaining the optimum matches between parking supply and demand with time-window constraints. First, a framework for shared parking is proposed to guide the development of the computation algorithms. Based on this framework, a mixed-integer nonlinear programming model and its solving algorithms are then developed to maximize the spatial-temporal utilization. Further, the feasibility and validity of the proposed model and algorithms are tested by empirical data collected in our real-world. The results indicate that the non-increased demand durations and non-descending supply durations (NI-ND) heuristic performs the best under both small- and large-scale supply and demand settings with extremely high solution efficiency. Moreover, the solutions based on the NI-ND algorithm are very close to the optimal objective, implying that the proposed shared parking allocation method based on the dual bin-packing principle is an effective way to address the realistic supply–demand relationship of parking resources under time-window constraints. Finally, the potential of shared parking is estimated based on the statistics of the number of private parking spaces and parking behavior data in Beijing.http://www.sciencedirect.com/science/article/pii/S2590198221000245Resource optimizationHeuristic algorithmShared parking space allocationDual bin-packing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Pengfei Zhao Hongzhi Guan Heng Wei Shixu Liu |
spellingShingle |
Pengfei Zhao Hongzhi Guan Heng Wei Shixu Liu Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China Transportation Research Interdisciplinary Perspectives Resource optimization Heuristic algorithm Shared parking space allocation Dual bin-packing |
author_facet |
Pengfei Zhao Hongzhi Guan Heng Wei Shixu Liu |
author_sort |
Pengfei Zhao |
title |
Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China |
title_short |
Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China |
title_full |
Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China |
title_fullStr |
Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China |
title_full_unstemmed |
Mathematical modeling and heuristic approaches to optimize shared parking resources: A case study of Beijing, China |
title_sort |
mathematical modeling and heuristic approaches to optimize shared parking resources: a case study of beijing, china |
publisher |
Elsevier |
series |
Transportation Research Interdisciplinary Perspectives |
issn |
2590-1982 |
publishDate |
2021-03-01 |
description |
Sharing unused private parking spaces with public travelers can improve parking resource utilization. However, a challenge lies in the approach to maximize the utilization of such parking resources without time colliding with the needs of these resources between public travelers and owners over time. To address this challenge, this study presents a methodology aiming at efficiently obtaining the optimum matches between parking supply and demand with time-window constraints. First, a framework for shared parking is proposed to guide the development of the computation algorithms. Based on this framework, a mixed-integer nonlinear programming model and its solving algorithms are then developed to maximize the spatial-temporal utilization. Further, the feasibility and validity of the proposed model and algorithms are tested by empirical data collected in our real-world. The results indicate that the non-increased demand durations and non-descending supply durations (NI-ND) heuristic performs the best under both small- and large-scale supply and demand settings with extremely high solution efficiency. Moreover, the solutions based on the NI-ND algorithm are very close to the optimal objective, implying that the proposed shared parking allocation method based on the dual bin-packing principle is an effective way to address the realistic supply–demand relationship of parking resources under time-window constraints. Finally, the potential of shared parking is estimated based on the statistics of the number of private parking spaces and parking behavior data in Beijing. |
topic |
Resource optimization Heuristic algorithm Shared parking space allocation Dual bin-packing |
url |
http://www.sciencedirect.com/science/article/pii/S2590198221000245 |
work_keys_str_mv |
AT pengfeizhao mathematicalmodelingandheuristicapproachestooptimizesharedparkingresourcesacasestudyofbeijingchina AT hongzhiguan mathematicalmodelingandheuristicapproachestooptimizesharedparkingresourcesacasestudyofbeijingchina AT hengwei mathematicalmodelingandheuristicapproachestooptimizesharedparkingresourcesacasestudyofbeijingchina AT shixuliu mathematicalmodelingandheuristicapproachestooptimizesharedparkingresourcesacasestudyofbeijingchina |
_version_ |
1724203876030087168 |