scholarly journals Algorithm for dynamic route assignment in complex street layouts

Author(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 ◽  
Author(s):  
Dušan Teichmann ◽  
Michal Dorda ◽  
Helena Bínová ◽  
Martin Ludvík

A typical trait of public transport is a spatially scattered demand. A route net that is operated by a carrier (or several carriers) has to be adapted to the demand. Public transport vehicles that are not used during a period of a day are usually parked in defined parking lots that have a given capacity. When the vehicle goes from the place where its schedule ends (usually a terminus of the last connection served by the vehicle) to the place where the vehicle should be parked, a non-productive journey occurs. The same occurs at the beginning of the vehicle schedule as well. The main goal of the paper is to present a mathematical model that enables minimization of the total length of all the non-productive journeys. Functionality of the proposed mathematical model was tested in the conditions of a real bus public transport network.


2021 ◽  
pp. 1-18
Author(s):  
Umberto Petruccelli

In a public transport network, an integration between lines generally involves, on one hand, the reduction in the number of direct links, which forces users to perform more vehicle switches, and on the other hand, the possibility of supplying a greater number of rides with the same mileage. Thus, the conversion of a direct link scheme to a feeder-trunk one to improve transit service efficiency in weak demand areas produces both negative and positive effects on accessibility. This paper deals with the built of a model able to estimate an equivalent travel time, taking into account the discomfort caused to users by the vehicle switch and the benefit arising from the greater availability of public transit rides. To validate this model and highlight benefits and limitations resulting from feeder-trunk supply schemes an application to a case study was developed.


2021 ◽  
Vol 11 (21) ◽  
pp. 10346
Author(s):  
Liliana Andrei ◽  
Oana Luca

The present paper aims to be useful for public transport operators and municipalities, as it should enable them to make decisions and to optimize public transport schedules during peak hours. In this study, we outline the data and the means necessary for the creation and use of a specific database for a dynamic spatial analysis of the public transportation network. This will facilitate the analysis of public transport vehicle operating programs and the simulation of new transport programs using open-source software. This paper delivers the first digital map of the public transport in Bucharest. Using the QGIS software and the PostgresSQL database, (i) we analyzed the accessibility of public transport stops for residential areas (5-min isochrones, corresponding to walking distances of 400 m), and (ii) we determined the correlation of transport vehicle programs with the existing transport network to optimize the headway of vehicles. These two elements were considered for the analysis of public transport performance. The research study was based on the tram network in Bucharest, but it can be easily upscaled for the entire public transport network and may be replicated in other large cities.


2019 ◽  
Vol 38 (12) ◽  
pp. 1831-1842
Author(s):  
Chao DU ◽  
Jiaoe WANG ◽  
Binquan LIU ◽  
Dingxi HUANG ◽  

Sign in / Sign up

Export Citation Format

Share Document