Abstract
A new mathematical model of transportation along the transport network represented by an undirected multigraph is formulated. A new criterion for the optimality of cargo carriages schedule is proposed. The criterion in addition to the time characteristics of transportation includes their cost, the number of undelivered cargoes. The problem to find the optimal schedule is formulated as a problem of mixed integer linear programming. Various variants of the algorithm for searching for an approximate solution to the problem are proposed. Informative examples are considered.
REFERENCES
Mor, A. and Speranza, M.G., Vehicle Routing Problems Over Time: A Survey, A Quart. J. Oper. Res., 2020, vol. 18, no. 2, pp. 129–149.
Vidal, T., Crainic, T.G., et al., A Unified Solution Framework for Multi-Attribute Vehicle Routing Problems, Eur. J. Oper. Res., 2014, vol. 234, no. 3, pp. 658–673.
Boctor, F.F., Laporte, G., and Renaud, J., Heuristics for the Traveling Purchaser Problem, Comput. Oper. Res., 2003, vol. 30, no. 4, pp. 491–504.
Cacchiani, V., Caprara, A., and Toth, P., A Column Generation Approach to Train Timetabling on a Corridor, 4OR, 2008, vol. 6, no. 2, pp. 125–142.
Gao, Yu., Kroon, L., et al., Three-Stage Optimization Method for the Problem of Scheduling Additional Trains on a High-Speed Rail Corridor, Omega, 2018, vol. 80, pp. 175–191.
Mu, S. and Dessouky, M., Scheduling Freight Trains Traveling on Complex Networks, Transport. Res. Part B: Methodologic, 2011, vol. 45, no. 7, pp. 1103–1123.
Forsgren, M., Aronsson, M., and Gestrelius, S., Maintaining Tracks and Traffic Flow at the Same Time, J. Rail Transport Planning Management, 2013, vol. 3, no. 3, pp. 111–123.
Sama, M., D’Ariano, A., et al., A Variable Neighbourhood Search for Fast Train Scheduling and Routing During Disturbed Railway Traffic Situations, Comput. Oper. Res., 2017, vol. 78, pp. 480–499.
Meng, L. and Zhou, X., Simultaneous Train Rerouting and Rescheduling on an N-Track Network: A Model Reformulation with Network-Based Cumulative Flow Variables, Transport. Res. Part B: Methodologic, 2014, vol. 67, pp. 208–234.
Lazarev, A.A. and Musatova, E.G., The Problem of Trains Formation and Scheduling: Integer Statements, Autom. Remote Control, 2013, vol. 74, no. 12, pp. 2064–2068.
Arkhipov, D.I. and Lazarev, A.A., Minimizing the Maximal Weighted Lateness of Delivering Orders between Two Railroad Stations, Autom. Remote Control, 2016, vol. 77, no. 12, pp. 2091–2109.
Buyanov, M.V., Ivanov, S.V., et al., Development of the Mathematical Model of Cargo Transportation Control on a Railway Network Segment Taking into Account Random Factors, Informatics and Applications, 2017, vol. 11, no. 4, pp. 85–93.
Buyanov, M.V. and Naumov, A.V., Optimizing the Operation of Rolling Stock in Organizing Cargo Transportation at a Railway Network Segment, Autom. Remote Control, 2018, vol. 79, no. 9, pp. 1661–1672.
Gainanov, D.N., Ignatov, A.N., et al., On Track Procession Assignment Problem at the Railway Network Sections, Autom. Remote Control, 2020, vol. 81, no. 6, pp. 967–977.
Ignatov, A.N., On the Scheduling Problem of Cargo Transportation on a Railway Network Segment and Algorithms for Its Solution, Bul. South Ural State Univ. Ser. Mat. Model. Progr., 2021, vol. 14, no. 3, pp. 61–76.
Bosov, A.V., Ignatov, A.N., and Naumov, A.V., Algorithms for an Approximate Solution of the Track Possession Problem on the Railway Network Segment, Informatics and Applications, 2021, vol. 15, no. 4, pp. 3–11.
Funding
The paper was supported by Russian Foundation for Basic Research (project no. 20-07-00046 A).
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Ignatov, A.N. On the General Problem Statement of Cargo Carriages Scheduling and Ways to Solve It. Autom Remote Control 84, 443–455 (2023). https://doi.org/10.1134/S0005117923040082
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117923040082