A competitive analysis approach for route choice with uncertain travel times and blocked nodes
This paper investigates the route choice problem on a network with uncertain travel times along the arcs and possible blocked nodes. The route choice decision is made with the simultaneous consideration of these two kinds of nondeterministic factors. In order to deal with these nondeterministic factors, online algorithms are introduced to develop adaptive route choice strategies responding to the successively observed blocked nodes; and accordingly, an uncertain competitive analysis framework, taking expected competitive ratio as the metric, is proposed to evaluate the performances of the online algorithms associated with uncertain travel times. It is proved that the competitive analysis for this route choice problem can be handled in the framework of traditional online shortest path problem via its equivalent counterpart on the corresponding deterministic network. Furthermore, two typical online strategies, i.e., reset strategy and greedy strategy, for route choice decision-making and the resulted performance difference are analyzed in detail following from the proposed framework.
KeywordsRoute choice Online routing Shortest path problem Uncertain competitive analysis Expected competitive ratio
This work was supported in part by Grants from the Ministry of Education Funded Project for Humanities and Social Sciences Research (no. 14YJC630124) and the National Natural Science Foundation of China (no. 71501123).
- Kahneman D, Tversky A (2013) Prospect theory: an analysis of decision under risk. In: Handbook of the fundamentals of financial decision making, pp 99–127Google Scholar
- Liu W(2010b) Uncertain programming models for shortest path problem with uncertain arc lengths. In: Proceedings of the first international conference on uncertainty theory, pp 148–153Google Scholar
- Liu B (2012) Why is there a need for uncertainty theory? J Uncertain Syst 6(1):3–10Google Scholar
- Ma WM, Chen GQ (2005) Competitive analysis for the on-line fuzzy shortest path problem. In: Proceedings of 2005 international conference on machine learning and cybernetics, pp 862–867Google Scholar
- Niroomand S, Mahmoodirad A, Heydari A, Kardani F, Hadi-Vencheh A (2017) An extension principle based solution approach for shortest path problem with fuzzy arc lengths. Oper Res Ger 17(2):395C–411Google Scholar