The problem of trains formation and scheduling: integer statements. (English. Russian original) Zbl 1292.90056
Autom. Remote Control 74, No. 12, 2064-2068 (2013); translation from Avtom. Telemekh. 2013, No. 12, 161-169 (2013).
Summary: This paper considers the problem of trains formation and routing in a railway network. Under given delivery orders at dispatch stations, it is required to form trains and define their schedules and routes to destination stations by minimizing the total weighted delivery time. We suggest integer statements of this problem that account constraints arising in practice.
MSC:
| 90B06 | Transportation, logistics and supply chain management |
References:
| [1] | Dantzig, G., Linear Programming and Extensions, Princeton: Princeton Univ. Press, 1963. Translated under the title Lineinoe programmirovanie, ego primeneniya i obobshcheniya, Moscow: Progress, 1966. |
| [2] | Lazarev, A.A., Musatova, E.G., Gafarov, E.R., and Kvaratskheliya, A.G., Teoriya raspisanii. Zadachi zheleznodorozhnogo planirovaniya (Scheduling Theory. Railway Planning Problems), Moscow: Inst. Probl. Upravlen., 2012. |
| [3] | Wolsey, L.A. and Nemhauser, G.L., Integer and Combinatorial Optimization, New York: Wiley, 1988. · Zbl 0652.90067 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
