Title: Dynamic models of transport resources management

Authors: Alexandr Vladimirovich Mishchenko; Oleg Anatolievich Kosorukov; Olga Alexandrovna Sviridova

Addresses: Department of Business Informatics, Financial University Under the Government of the Russian Federation, 49 Leningradsky Prospekt, Moscow, 125993, Russia ' Graduate School of Management and Innovation (Department), Lomonosov Moscow State University, GSP-1, Leninskiye Gory, h. 1, Bld. 51, Moscow, 119991, Russia and Russian Presidential Academy of National Economy and Public Administration, 82 Prospekt Vernadskogo, Moscow, Russia ' Department of Data Analysis and Machine Learning, Financial University Under the Government of the Russian Federation, 49 Leningradsky Prospekt, Moscow, 125993, Russia and Department of Mathematical Methods in Economics, Plekhanov Russian University of Economics, Stremyanny Lane, 36, 115054, Moscow, 115054, Russia

Abstract: The article discusses various models for managing transport resources, the purpose of which is to distribute a finite number of transport units along several routes of land urban transport. The values reflecting the timeliness of transport services provided to the population were taken as the optimisation criteria when searching for a solution. So, for example, models were considered when it was required to minimise the total loss of time waiting for transport services, as well as the number of passengers whose waiting time exceeds a certain critical value. In addition, a stochastic model of transport resource management was considered, when various scenarios of the development of events were taken into account (different intensities of passengers arriving at stops). Methods for assessing the stability of solutions obtained using the branch and bound methods were proposed.

Keywords: optimisation problem; urban passing of transport; branch-and-bound method; stochastic model.

DOI: 10.1504/IJLSM.2023.135422

International Journal of Logistics Systems and Management, 2023 Vol.46 No.4, pp.518 - 546

Received: 21 Feb 2021
Accepted: 21 Jun 2021
Published online: 12 Dec 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article