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.
Get full access to this article
View all access options for this article.