Abstract
The paper treats some problems of rational route choice for a city road network with changing traffic load. Determination of the optimum route in the strict sense as a program acting from the start time of a certain trip is impossible, the cause consisting in its dependence on future behavior of other drivers. Two approaches to the problem setup and solution are proposed. The first consists in definition of the entire set of suboptimum acyclic routes between start and destination points. For the problem solution the generalization of method by Shier for determining the K shortest paths in a network is proposed. On this basis the most reasonable route may be chosen as the suboptimum route with the minimum prognosis duration. The problem in question is that of the optimum route choice for a network with a known traffic dynamics: its implementation may be based on regularity of traffic dynamics trends taking place for a certain day of a week. The problem setup and Dijkstra algorithm modification is proposed. Some aspects of its computational complexity are studied both theoretically and by means of computational experiments. The latter are fulfilled with our computer program aimed for routes optimization and analysis of route method efficiency that may be studied on real networks as well as randomly generated ones. In addition, as an alternative to dynamic programming methods variants of branch-and-bound method are proposed for both problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shier DA (1976) Networks (6):205–230.
Dijkstra EW (1959) Numerische Mathematik 1:269–271.
Anikeich AA., Gribov AB., Surin SS (1976) Computer-aided planning of truck jobs for a shift and a day. Transport, Moscow (In Russian).
Denardo EV, Fox BI. (1979) Operations Research 27:161–186.
Cherkassky BV, Goldberg AV, Silverstein C (1999) SIAM Journal Comput 28:1326–1346.
Levit BYu., Livshits VN (1972). Nonlinear transportation problems on networks. Transport, Moscow (In Russian).
Valuev AM, Velichenko VV (2002) Journal Computer Syst Sci Internat 41:979–987.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yakukhnov, A.A., Valuev, A.M. (2013). Some Problems of Rational Route Choice for a City Road Network. In: Kozlov, V., Buslaev, A., Bugaev, A., Yashina, M., Schadschneider, A., Schreckenberg, M. (eds) Traffic and Granular Flow '11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39669-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-39669-4_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39668-7
Online ISBN: 978-3-642-39669-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)