Abstract
In networks with uncertain link travel times, route guidance information should consider traveler preferences. Risk-averse travelers prefer safer options but might feel unsatisfied if it is found that their decisions have been based on the wrong expectations. This paper therefore proposes a new approach to take regret, disappointment, and risk aversion into consideration in route navigation. Limited information is assumed: The router knows minimum and maximum travel times of links but not the probability distribution of link travel times. Routes using only potentially optimal links are chosen by weighting the travel times scenarios expected on a given path and taking into account the cost of alternative options. Two approaches are explored, referred to as global and local search. The local search can be implemented as a fast method avoiding path search by guiding travelers link by link. As a drawback local search potentially can lead to cyclic paths. Possibilities to overcome the cyclic path issue and boundary properties of both approaches are discussed. Monte Carlo simulation on a U.S. network suggests that the two approaches can provide good solutions to the problem of route choice under severe lack of information. The local search seems to be particularly promising.
Highlights
The search for the shortest path (SP) is central to transportation research
An approach has been presented suitable for route choice in transport networks subject to potential delays with unknown probability
Decision making is based on the assumption that such knowledge is used to avoid links which cannot be optimal in any link state on the network
Summary
The search for the shortest path (SP) is central to transportation research. SP search becomes non-trivial in networks characterised by uncertainty. DECISION MAKING APPROACH A framework is proposed and tested for route choice in transport networks in which the travel time of each link can take only two values, corresponding to undelayed and delayed traffic conditions. The second approach incorporates expected frustration as a criterion to select iteratively one PO link downstream of the last node included in the path identified by the search algorithm until the destination is reached. ROUTE CHOICE CONSIDERING RISK-AVERSION AND FRUSTRATION In the context of navigation assistance a good method to select a path from the PO network ought to comply with the following requirements: It should utilize all the knowledge already developed in defining the PO network to ensure fast calculation and to avoid wasting information. The algorithms for global and local searches are summarized below ( APO indicates the PO links)
Sign-in/Register to view highlights & summary 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.
