Abstract
An algorithm is developed that provides not only least-cost alternate routes but also ones that are close to the least-cost routes for users to select from multiple paths that route through points of interest. The algorithm utilizes a link-based search method rather than the traditional node-based search method. The link-based algorithm is able to use the existing transportation network by allowing U-turns and restricting left turns without modifications. The algorithm also uses relative prices rather than absolute prices in selecting paths. The relative price is the difference between the minimum price available in the market and the price that is available on a path. Introduction of relative prices enables the provision of flexible route guidance to meet the various needs of users. The algorithm developed has been applied to a virtual network, which successfully demonstrated the implementation of the multipath search algorithm for multipurpose activities.
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 callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: 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.
