Matching Model between Private Idle Parking Slots and Demanders for Parking Slot Sharing
Publication: Journal of Transportation Engineering, Part A: Systems
Volume 147, Issue 6
Abstract
A two-stage method for matching private idle parking slots with demanders is proposed based on the core idea of private idle parking slot sharing to solve the problem of parking difficulty in a shared economy environment. This method combines knowledge rules and a multiobjective optimization model. In the first stage, knowledge rules for screening private idle parking slots that meet demanders’ walking distance and parking price requirements are proposed. In the second stage, the degree of satisfaction of demanders concerning parking price and walking distance from private idle parking slots to their destination and the degree of satisfaction of private idle parking slots regarding parking slot occupancy rates are constructed first. Then, considering whether private idle parking slot owners provide extended time, a multiobjective optimization model is established by maximizing the satisfaction degree of demanders, the satisfaction degree of private idle parking slot owners, and the profits of the platform. Further, an improved nondominated sorting genetic algorithm II (INSGA II) is developed to solve the model. Finally, a practical example is used to illustrate the feasibility and effectiveness of the proposed method.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
All data, models, and code generated or used during the study appear in the published article.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (NSFC) (Project 71871048).
References
Arnott, R., and E. Inci. 2006. “An integrated model of downtown parking and traffic congestion.” J. Urban Econ. 60 (3): 418–442. https://doi.org/10.1016/j.jue.2006.04.004.
Cai, Y., J. Chen, C. Zhang, and B. Wang. 2019. “A parking space allocation method to make a shared parking strategy for appertaining parking lots of public buildings.” Sustainability 11 (1): 120. https://doi.org/10.3390/su11010120.
Deb, K., A. Pratap, S. Agarwal, and T. A. M. T. Meyarivan. 2002. “A fast and elitist multiobjective genetic algorithm: NSGA-II.” IEEE Trans. Evol. Comput. 6 (2): 182–197. https://doi.org/10.1109/4235.996017.
Ding, T., B. Wang, L. Zheng, J. Xi, and S. Xu. 2017. “Research on parking choice model based on shared private parking space.” In Proc., Int. Conf. on Green Intelligent Transportation System and Safety, 935–948. New York: Springer. https://doi.org/10.1007/978-981-10-3551-7_75.
Elarbi, M., S. Bechikh, A. Gupta, L. B. Said, and Y. S. Ong. 2018. “A new decomposition-based NSGA-II for many-objective optimization.” IEEE Trans. Syst. Man Cybern. 48 (7): 1191–1210. https://doi.org/10.1109/TSMC.2017.2654301.
Gong, G., Q. Deng, X. Gong, W. Liu, and Q. Ren. 2018. “A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators.” J. Cleaner Prod. 174 (Feb): 560–576. https://doi.org/10.1016/j.jclepro.2017.10.188.
Huang, X., X. Long, J. Wang, and L. He. 2020. “Research on parking sharing strategies considering user overtime parking.” PLoS One 15 (6): e0233772. https://doi.org/10.1371/journal.pone.0233772.
Jiang, B. W., and Z. P. Fan. 2020. “Optimal allocation of shared parking slots considering parking unpunctuality under a platform-based management approach.” Transp. Res. Part E Logist. Transp. Rev. 142 (Oct): 102062. https://doi.org/10.1016/j.tre.2020.102062.
Kong, X. T. R., S. X. Xu, M. Cheng, and G. Q. Huang. 2018. “Iot-enabled parking space sharing and allocation mechanisms.” IEEE Trans. Autom. Sci. Eng. 15 (4): 1–1439. https://doi.org/10.1109/TASE.2018.2872643.
Li, C., Y. Tao, and S. Liu. 2021. “A shared parking space optimization model to alleviate china’s parking problem considering travelers’ tiered credit risk.” Transp. Lett. 13 (1): 45–52. https://doi.org/10.1080/19427867.2019.1700013.
Liao, W., L. Zhang, and Z. Wei. 2020. “Multi-objective green meal delivery routing problem based on a two-stage solution strategy.” J. Cleaner Prod. 258 (Jun): 120627. https://doi.org/10.1016/j.jclepro.2020.120627.
Liu, W., and N. Geroliminis. 2016. “Modeling the morning commute for urban networks with cruising-for-parking: An MFD approach.” Transp. Res. Part B Methodol. 93 (Nov): 470–494. https://doi.org/10.1016/j.trb.2016.08.004.
Liu, X., H. Hu, and Z. Deng. 2020. “The shared allocation model of night parking spaces between residential areas and adjacent business districts.” In Proc., IEEE 2019 Int. Conf. on Artificial Intelligence and Advanced Manufacturing, 527–532. New York: IEEE. https://doi.org/10.1109/AIAM48774.2019.00110.
Ouerfelli, H., and A. Dammak. 2013. “The genetic algorithm with two point crossover to solve the resource-constrained project scheduling problems.” In Proc., IEEE 5th Int. Conf. on Modeling, Simulation and Applied Optimization, 1–4. New York: IEEE. https://doi.org/10.1109/ICMSAO.2013.6552686.
Shao, C., H. Yang, Y. Zhang, and J. Ke. 2016. “A simple reservation and allocation model of shared parking lots.” Transp. Res. Part C Emerging Technol. 71 (Oct): 303–312. https://doi.org/10.1016/j.trc.2016.08.010.
Shekarian, M., S. V. R. Nooraie, and M. M. Parast. 2020. “An examination of the impact of flexibility and agility on mitigating supply chain disruptions.” Int. J. Prod. Econ. 220 (Feb): 107438. https://doi.org/10.1016/j.ijpe.2019.07.011.
Shoup, D. 2006. “Cruising for parking.” Transp. Policy 13 (6): 479–486. https://doi.org/10.1016/j.tranpol.2006.05.005.
Shoup, D. 2011. “Free parking or free markets.” Access Mag. 1 (38): 28–35. https://doi.org/10.4324/9781351019668-29.
Su, Q., and D. Z. W. Wang. 2018. “Morning commute problem with supply management considering parking and ride-sourcing.” Transp. Res. Part C Emerging Technol. 105 (Aug): 626–647. https://doi.org/10.1016/j.trc.2018.12.015.
Su, Q., and D. Z. W. Wang. 2020. “On the morning commute problem with distant parking options in the era of autonomous vehicles.” Transp. Res. Part C Emerging Technol. 120 (Nov): 102799. https://doi.org/10.1016/j.trc.2020.102799.
Su, X. X., C. Meng, X. T. R. Kong, Y. Hai, and G. Q. Huang. 2016. “Private parking slot sharing.” Transp. Res. Part B Methodol. 93 (Nov): 596–617. https://doi.org/10.1016/j.trb.2016.08.017.
Tan, B. Q., S. X. Xu, R. Zhong, M. Cheng, and K. Kang. 2019. “Sequential auction based parking space sharing and pricing mechanism in the era of sharing economy.” Ind. Manage. Data Syst. 119 (8): 1734–1747. https://doi.org/10.1108/IMDS-04-2019-0244.
Tian, L. J., J. B. Sheu, and H. J. Huang. 2019. “The morning commute problem with endogenous shared autonomous vehicle penetration and parking space constraint.” Transp. Res. Part B Methodol. 123 (May): 258–278. https://doi.org/10.1016/j.trb.2019.04.001.
Van Ommeren, J. N., D. Wentink, and P. Rietveld. 2012. “Empirical evidence on cruising for parking.” Transp. Res. Part A Policy Pract. 46 (1): 123–130. https://doi.org/10.1016/j.tra.2011.09.011.
Wang, X. P., H. Honghui, Z. Zhiying, and Z. Mingming. 2019. “Bi-level optimization model of O2O fresh product experience store location considering service quality.” Procedia Comput. Sci. 159 (Oct): 1767–1776. https://doi.org/10.1016/j.procs.2019.09.348.
Wu, Z., S. Sun, and S. Yu. 2020. “Optimizing makespan and stability risks in job shop scheduling.” Comput. Oper. Res. 122 (Oct): 104963. https://doi.org/10.1016/j.cor.2020.104963.
Xiao, H., X. Meng, and Z. Gao. 2018. “Shared parking problem: A novel truthful double auction mechanism approach.” Transp. Res. Part B Methodol. 109 (Mar): 40–69. https://doi.org/10.1016/j.trb.2018.01.008.
Xiao, H., and M. Xu. 2018. “How to restrain participants opt out in shared parking market? A fair recurrent double auction approach.” Transp. Res. Part C Emerging Technol. 93 (Aug): 36–61. https://doi.org/10.1016/j.trc.2018.05.023.
Xiao, H., M. Xu, and H. Yang. 2020. “Pricing strategies for shared parking management with double auction approach: Differential price vs. uniform price.” Transp. Res. Part E Logsist. Transp. Rev. 136 (Apr): 101899. https://doi.org/10.1016/j.tre.2020.101899.
Yan, P., X. Cai, D. Ni, F. Chu, and H. He. 2021. “Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs.” Comput. Oper. Res. 125 (Jan): 105083. https://doi.org/10.1016/j.cor.2020.105083.
Yang, B., Z. Yuan, Y. Yang, R. Yin, and Y. Wang. 2017. “The study on allocation model of shared parking slots in multi-parking lots.” In Proc., 2017 5th Int. Conf. on Mechatronics, Materials, Chemistry and Computer Engineering (ICMMCCE 2017), 395–403. Gippsland, Australia: Atlantis Press. https://doi.org/10.2991/icmmcce-17.2017.87.
Zhang, F., W. Liu, X. Wang, and H. Yang. 2020a. “Parking sharing problem with spatially distributed parking supplies.” Transp. Res. Part C Emerging Technol. 117 (Aug): 102676. https://doi.org/10.1016/j.trc.2020.102676.
Zhang, L., and Y. Mu. 2018. “Parking space allocation with uncertain demand and supply consideration.” In Proc., Int. Conf. on Service Systems and Service Management (ICSSSM), 1–5. Piscataway, NJ: IEEE. https://doi.org/10.1109/ICSSSM.2018.8464961.
Zhang, W., F. Gao, S. Sun, Q. Yu, and B. Liu. 2020b. “A distribution model for shared parking in residential zones that considers the utilization rate and the walking distance.” J. Adv. Transp. 2020 (Mar): 1–11. https://doi.org/10.1155/2020/6147974.
Zhao, P., H. Guan, and P. Wang. 2020. “Data-driven robust optimal allocation of shared parking spaces strategy considering uncertainty of public users’ and owners’ arrival and departure: An agent-based approach.” IEEE Access 8 (Jan): 24182–24195. https://doi.org/10.1109/ACCESS.2020.2969987.
Information & Authors
Information
Published In
Journal of Transportation Engineering, Part A: Systems
Volume 147 • Issue 6 • June 2021
Copyright
© 2021 American Society of Civil Engineers.
History
Received: Jul 23, 2020
Accepted: Feb 3, 2021
Published online: Mar 25, 2021
Published in print: Jun 1, 2021
Discussion open until: Aug 25, 2021
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.