Physics, mathematics, and technology

2017 Issue №1

Back to the list Download the article

A solution of the transport task in relation to the cargo rail transportation



A task of searching of the optimal route maximizing the carrier profits is formulated. А сomparison of several methods of this task solution is carried out.


1. Balas E., Martin G. ROLL-A-ROUND: Software Package for Scheduling the Rounds of a Rolling Mill. Pittsburgh, PA, 1986.
2. Fischetti M., Toth P. An additive approach for the optimal solution of the prizecollecting travelling salesman problem // Vehicle Routing: Methods and Studies. North-Holland, 1988. P. 319–343.
3. Balas E. The prize collecting traveling salesman problem // Networks. 1989. Vol. 19. P. 621–636.
4. Balas E. The prize collecting traveling salesman problem: II. Polyhedral results // Ibid. 1995. Vol. 25. P. 199–216.
5. Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW // INFORMS Journal on Computing. 2002. № 14 (4). Р. 403—417.
6. Bar-Yehuda R., Evenb G., Shahar S.(M.) On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows // Journal of Algorithms. 2005. April. P. 76–93.