Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation
Abstract This research aims to improve the utilization efficiency of parking facilities in residential areas. The real‐time and fixed‐time shared parking spot allocation models based on a time window constraint are proposed, respectively. The real‐time model adopts the dynamic response service mecha...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-04-01
|
| Series: | IET Intelligent Transport Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/itr2.12343 |
| _version_ | 1797226465596538880 |
|---|---|
| author | Yang Yang Bo Yang Zhenzhou Yuan Ran Meng Yunpeng Wang |
| author_facet | Yang Yang Bo Yang Zhenzhou Yuan Ran Meng Yunpeng Wang |
| author_sort | Yang Yang |
| collection | DOAJ |
| description | Abstract This research aims to improve the utilization efficiency of parking facilities in residential areas. The real‐time and fixed‐time shared parking spot allocation models based on a time window constraint are proposed, respectively. The real‐time model adopts the dynamic response service mechanism, introducing a multi‐objective decision weighting method to construct the weighted evaluation function. Then, the 0–1 planning model with user optimization is established, utilizing branch‐bound algorithm for a solution. The fixed‐time model adopts the periodic service mechanism, where a rejection penalty factor is introduced to add penalty cost. Then, the 0–1 programming model with system optimization is constructed, where genetic annealing algorithm solves the large‐scale calculation problem. The results from this case study illustrate the fixed‐time allocation mode has more balanced utilization of parking facilities, whereas over‐utilization of preferred parking lots occurs in the real‐time model; additionally, when supply and demand are in balance, the fixed‐time model can obtain higher system revenues, reduce effective rejection rate by 9.43%, and increase resource utilization efficiency by 5.28%. In conclusion, the real‐time allocation mode reflects the advantage of a user's optimal allocation mode when supply is greater than demand; conversely, the fixed‐time allocation mode has the advantage of optimum system resources utilization efficiency. |
| first_indexed | 2024-04-24T14:25:20Z |
| format | Article |
| id | doaj.art-113fafa8ce9d4d9b9f72db166256b870 |
| institution | Directory Open Access Journal |
| issn | 1751-956X 1751-9578 |
| language | English |
| last_indexed | 2024-04-24T14:25:20Z |
| publishDate | 2024-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Intelligent Transport Systems |
| spelling | doaj.art-113fafa8ce9d4d9b9f72db166256b8702024-04-03T04:47:27ZengWileyIET Intelligent Transport Systems1751-956X1751-95782024-04-0118459961810.1049/itr2.12343Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocationYang Yang0Bo Yang1Zhenzhou Yuan2Ran Meng3Yunpeng Wang4School of Transportation Science and Engineering Beihang University Beijing ChinaShenzhen Urban Transport Planning Center CO., LTD Shenzhen Guangdong ChinaSchool of Traffic and Transportation Beijing Jiaotong University Beijing ChinaSchool of Traffic and Transportation Beijing Jiaotong University Beijing ChinaSchool of Transportation Science and Engineering Beihang University Beijing ChinaAbstract This research aims to improve the utilization efficiency of parking facilities in residential areas. The real‐time and fixed‐time shared parking spot allocation models based on a time window constraint are proposed, respectively. The real‐time model adopts the dynamic response service mechanism, introducing a multi‐objective decision weighting method to construct the weighted evaluation function. Then, the 0–1 planning model with user optimization is established, utilizing branch‐bound algorithm for a solution. The fixed‐time model adopts the periodic service mechanism, where a rejection penalty factor is introduced to add penalty cost. Then, the 0–1 programming model with system optimization is constructed, where genetic annealing algorithm solves the large‐scale calculation problem. The results from this case study illustrate the fixed‐time allocation mode has more balanced utilization of parking facilities, whereas over‐utilization of preferred parking lots occurs in the real‐time model; additionally, when supply and demand are in balance, the fixed‐time model can obtain higher system revenues, reduce effective rejection rate by 9.43%, and increase resource utilization efficiency by 5.28%. In conclusion, the real‐time allocation mode reflects the advantage of a user's optimal allocation mode when supply is greater than demand; conversely, the fixed‐time allocation mode has the advantage of optimum system resources utilization efficiency.https://doi.org/10.1049/itr2.123430–1 planning modelfixed‐time parking spot allocationreal‐time parking spot allocationshared parkingtime window constrainturban traffic |
| spellingShingle | Yang Yang Bo Yang Zhenzhou Yuan Ran Meng Yunpeng Wang Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation IET Intelligent Transport Systems 0–1 planning model fixed‐time parking spot allocation real‐time parking spot allocation shared parking time window constraint urban traffic |
| title | Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation |
| title_full | Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation |
| title_fullStr | Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation |
| title_full_unstemmed | Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation |
| title_short | Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation |
| title_sort | modelling and comparing two modes of sharing parking spots at residential area real time and fixed time allocation |
| topic | 0–1 planning model fixed‐time parking spot allocation real‐time parking spot allocation shared parking time window constraint urban traffic |
| url | https://doi.org/10.1049/itr2.12343 |
| work_keys_str_mv | AT yangyang modellingandcomparingtwomodesofsharingparkingspotsatresidentialarearealtimeandfixedtimeallocation AT boyang modellingandcomparingtwomodesofsharingparkingspotsatresidentialarearealtimeandfixedtimeallocation AT zhenzhouyuan modellingandcomparingtwomodesofsharingparkingspotsatresidentialarearealtimeandfixedtimeallocation AT ranmeng modellingandcomparingtwomodesofsharingparkingspotsatresidentialarearealtimeandfixedtimeallocation AT yunpengwang modellingandcomparingtwomodesofsharingparkingspotsatresidentialarearealtimeandfixedtimeallocation |