Algorithm for dynamic route assignment in complex street layouts
Keyword(s):
In some scenarios, public transport vehicles do not have permanently fixed routes that make it hard to implement optimal automatic routing techniques and use forecasting algorithms. To solve the problem of route destination, a mathematical model of the dynamic route assignment is developed. It is based on the graph model of the street layouts and includes the results of the arrival of vehicles in certain points. The proposed algorithm enables to dynamically recalculate the routes, depending on the intersection of the four types of nodes representing the key points of the transport network. A case study for the route assignment in city of Severodonetsk is discussed.
2015 ◽
Vol 27
(1)
◽
pp. 69-75
◽
2020 ◽
Vol 47
◽
pp. 672-679
◽
Keyword(s):
2019 ◽
Vol 29
(1)
◽
pp. 35-61
2011 ◽