A method for constructing Pareto-optimal logistic schemes for car movement and its application for standardization of the working fleet
https://doi.org/10.46973/0201-727X_2026_1_219
Abstract
The paper proposes a two-stage approach to norming the working fleet of freight cars of operating companies under nonstationary traffic conditions. At the first stage, for a fixed planning interval, the set of feasible Pareto-optimal logistic schemes is generated in a directed transportation graph using additive operational criteria such as turnaround time, empty mileage, variable operating costs and other technological indicators. It is shown that the tariff or revenue effect of the scheme is non-additive and therefore has to be evaluated after constructing the complete route, rather than as the sum of the values for individual arcs. At the second stage, a rolling-horizon optimization model is solved to minimize the required working fleet while satisfying period-by-period transportation demand and, if needed, inter-period wagon-balance constraints. Little's formula is used only as a local aggregate estimate for an individual scheme and not as a direct computational model for a heterogeneous nonstationary rail network. A small illustrative example is provided to demonstrate the logical link between the scheme-generation stage and the fleet standardization stage.
About the Authors
A. T. Osminin
Emperor Alexander I Saint Petersburg State Transport University (PSTU)
Russian Federation
Russian Federation
Osminin Aleksandr Trofimovich, Chair “Operational Management”, Doctor of Engineering Sciences, Professor
A. N. Baushev
Emperor Alexander I Saint Petersburg State Transport University (PSTU), Chair “Operational Management”
Russian Federation
Russian Federation
Baushev Aleksey Nikolaevich, Candidate of Physical and Mathematical Sciences, Associate Professor, Research Fellow
L. A. Osminin
Emperor Alexander I Saint Petersburg State Transport University (PSTU), Chair “Operational Management”
Russian Federation
Russian Federation
Osminin Leonid Aleksandrovich, Candidate of Engineering Sciences, Researcher
References
1. Little, J. D. C. A Proof for the Queuing Formula L = λW / J. D. C. Little // Operations Research. – 1961. – Vol. 9 (3). – P. 383–387. – DOI 10.1287/opre.9.3.383.
2. Fundamentals of Queueing Theory / D. Gross, J. F. Shortle, J. M. Thompson, C. M. Harris. – 4th ed. – Hoboken : John Wiley & Sons, 2008. – 528 p. – ISBN 978-0-471-79127-0.
3. Ehrgott, M. Multicriteria Optimization / M. Ehrgott. – Berlin : Springer-Verlag, 2005. – 323 p. – ISBN 3-540-21398-8.
4. A fast and elitist multiobjective genetic algorithm: NSGA-II / K. Deb, A. Pratap, S. Agarwal, T. Meyarivan // IEEE Transactions on Evolutionary Computation. – 2002. – Vol. 6 (2). – P. 182–197. – DOI 10.1109/4235.996017.
5. Dijkstra, E. W. A note on two problems in connexion with graphs / E. W. Dijkstra // Numerische Mathematik. – 1959. – Vol. 1. – P. 269–271. – DOI 10.1007/BF01386390.
6. Introduction to Algorithms / T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. – 3rd ed. – Cambridge, MA : MIT Press, 2009. – 1292 p. – ISBN 978-0-26253-305-8.
7. Preparata, F. P. Computational Geometry: An Introduction / F. P. Preparata, M. I. Shamos. – New York : Springer-Verlag, 1985. – 390 p. – ISBN 0-387-96131-3.
8. Algorithms and methods for solving scheduling problems and other extremum problems on large-scale graphs / S. V. Chernyshev, E. A. Cherepanov, E. V. Pankratiev, A. M. Chepovskii // Journal of Mathematical Sciences. – 2005. – Vol. 128 (6). – P. 3487–3495.
9. Birge, J. R. Introduction to Stochastic Programming / J. R. Birge, F. Louveaux. – New York : Springer, 2011. – 485 p.
10. Shapiro, A. Lectures on Stochastic Programming : Modeling and Theory / A. Shapiro, D. Dentcheva, A. Ruszczyński. – Philadelphia : SIAM, 2009. – DOI 10.1137/1.9780898718751.
11. Applications of Stochastic Programming / S. W. Wallace, W. T. Ziemba (eds.). – Philadelphia : SIAM, 2005. – 709 p. – ISBN 978-0-89871-555-2.
12. King, A. J. Modeling with Stochastic Programming / A. J. King, S. W. Wallace. – New York : Springer, 2012. – DOI 10.1007/978-0-387-87817-1.
13. Ben-Tal, A. Robust Optimization / A. Ben-Tal, L. El Ghaoui, A. Nemirovski. – Princeton, NJ : Princeton University Press, 2009. – 576 p. – ISBN 978-0-691-14368-2.
14. Kall, P. Stochastic Programming / P. Kall, S. W. Wallace. – Chichester : John Wiley & Sons, 1994. – 307 p. – ISBN 978-0-471-95108-7.
15. Martello, S. Knapsack Problems : Algorithms and Computer Implementations / S. Martello, P. Toth. – Chichester: John Wiley & Sons ; 1990. – ISBN 978-0-471-92420-3.
Review
For citations:
Osminin A.T., Baushev A.N., Osminin L.A. A method for constructing Pareto-optimal logistic schemes for car movement and its application for standardization of the working fleet. Vestnik Rostovskogo Gosudarstvennogo Universiteta Putej Soobshcheniya. 2026;(1):219-225. (In Russ.) https://doi.org/10.46973/0201-727X_2026_1_219
Views:
31
JATS XML
Email this article 