Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance
Bus hub is characterized with multiple berths, each serving specific bus routes. When bus routes at different berths share the same stops en route, passengers to the shared stops may rush among these berths to catch the newly arriving bus, causing inconvenience and deteriorating bus service level. T...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1590504 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549012250558464 |
|---|---|
| author | Yan-Pei Zhang Hui Jin Hai-Ming Hao Xiao-Guang Yang |
| author_facet | Yan-Pei Zhang Hui Jin Hai-Ming Hao Xiao-Guang Yang |
| author_sort | Yan-Pei Zhang |
| collection | DOAJ |
| description | Bus hub is characterized with multiple berths, each serving specific bus routes. When bus routes at different berths share the same stops en route, passengers to the shared stops may rush among these berths to catch the newly arriving bus, causing inconvenience and deteriorating bus service level. Thus, this research attempts to optimize bus route assignment to the berths at a bus hub to minimize passenger transfer distance among the optional berths. The problem is modeled with integer linear programming, with the constraints of bus service capacity. To enhance computation efficiency, exclusive and inclusive constraints based on the count of shared stops among the bus routes are additionally added to the original model, though they may bring gap from the optimal solution. Case study follows to apply the proposed set of models to a bus terminal, where a total of 26 routes are assigned to 11 berths. It is found that the models with additional constraints can greatly reduce calculation time at the cost of small or no gap from the optimal solution. Thus, the models with additional constraints are recommended to obtain ideal solution quickly. This research provides insights into bus route management at the bus terminal with multiple berths, contributing to enhanced passenger waiting experience. |
| format | Article |
| id | doaj-art-27564a97dffa4c5098820abe4ef1e71f |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-27564a97dffa4c5098820abe4ef1e71f2025-02-03T06:12:26ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/1590504Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer DistanceYan-Pei Zhang0Hui Jin1Hai-Ming Hao2Xiao-Guang Yang3School of Rail TransportationSchool of Rail TransportationSchool of Civil and Transportation EngineeringKey Laboratory of Road and Traffic Engineering of Ministry of EducationBus hub is characterized with multiple berths, each serving specific bus routes. When bus routes at different berths share the same stops en route, passengers to the shared stops may rush among these berths to catch the newly arriving bus, causing inconvenience and deteriorating bus service level. Thus, this research attempts to optimize bus route assignment to the berths at a bus hub to minimize passenger transfer distance among the optional berths. The problem is modeled with integer linear programming, with the constraints of bus service capacity. To enhance computation efficiency, exclusive and inclusive constraints based on the count of shared stops among the bus routes are additionally added to the original model, though they may bring gap from the optimal solution. Case study follows to apply the proposed set of models to a bus terminal, where a total of 26 routes are assigned to 11 berths. It is found that the models with additional constraints can greatly reduce calculation time at the cost of small or no gap from the optimal solution. Thus, the models with additional constraints are recommended to obtain ideal solution quickly. This research provides insights into bus route management at the bus terminal with multiple berths, contributing to enhanced passenger waiting experience.http://dx.doi.org/10.1155/2022/1590504 |
| spellingShingle | Yan-Pei Zhang Hui Jin Hai-Ming Hao Xiao-Guang Yang Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance Journal of Mathematics |
| title | Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance |
| title_full | Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance |
| title_fullStr | Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance |
| title_full_unstemmed | Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance |
| title_short | Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance |
| title_sort | optimal route assignment at the bus hub with multiple berths for minimal passenger transfer distance |
| url | http://dx.doi.org/10.1155/2022/1590504 |
| work_keys_str_mv | AT yanpeizhang optimalrouteassignmentatthebushubwithmultipleberthsforminimalpassengertransferdistance AT huijin optimalrouteassignmentatthebushubwithmultipleberthsforminimalpassengertransferdistance AT haiminghao optimalrouteassignmentatthebushubwithmultipleberthsforminimalpassengertransferdistance AT xiaoguangyang optimalrouteassignmentatthebushubwithmultipleberthsforminimalpassengertransferdistance |