Abstract
The modern urban transportation service network could be split into unrestricted and restricted networks depending on whether travelers face limitations in route selection. Along with the continuous expansion of the city, it is difficult for travelers to find a more reasonable travel solution when confronted with such a complex transportation service network, which combines both unrestricted and restricted networks, especially for the park-and-ride (P&R) travel mode. This paper addresses the issue of route analysis in modern urban transportation service systems to provide travelers with reasonable travel solutions based on multiple types of transportation services. An improved A* algorithm is proposed to address the optimal path analysis for restricted networks to provide reasonable travel solutions for public transportation trips. Furthermore, by establishing the topological relationship between restricted and unrestricted networks, this paper presented an improved A* algorithm based on hybrid networks that solves the optimal path analysis problem for P&R trips, bringing convenience to many urban travelers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
