Open AccessAlgorithm for dynamic route assignment in complex street layouts
Author(s) -
Maryna Derkach,
Inna Skarga-Bandurova
Publication year - 2019
Publication title -
vìsnik shìdnoukraïnsʹkogo nacìonalʹnogo unìversitetu ìmenì volodimira dalâ
Language(s) - English
Resource type - Journals
eISSN - 2664-6498
pISSN - 1998-7927
DOI - 10.33216/1998-7927-2019-253-5-37-40
Subject(s) - intersection (aeronautics) , computer science , routing (electronic design automation) , graph , key (lock) , mathematical optimization , transport engineering , theoretical computer science , computer network , engineering , mathematics , computer security
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.