×
Bronshtein, E. M.; Zaiko, T. A.

Deterministic optimizational problems of transportation logistics. (English. Russian original) Zbl 1218.93011

Autom. Remote Control 71, No. 10, 2132-2144 (2010); translation from Avtom. Telemekh. 2010, No. 10, 133-147 (2010).
Summary: We give a survey of a wide class of transportation logistics problems, in which we consider, from a unified standpoint, both discrete (e.g., routing) and continuous (e.g., classical transport) problems. We single out a collection of elementary premises that underlie such problems, give corresponding mathematical models and approaches to the solution. We also consider a new multinomenclature for transportation logistics problems.

Cited in 1 Document

MSC:

93A30 Mathematical modelling of systems (MSC2010)
90B06 Transportation, logistics and supply chain management
49N90 Applications of optimal control and differential games

Keywords:

transportation logistics problems; discrete problems; continuous problems; problems; mathematical models

Software:

VRP
Cite Review PDF
Full Text: DOI

References:

[1] Parragh, S., Doerner, K., and Hartl, R., A Survey on Pickup and Delivery Problems. I. Transportations between Customers and Depot, J. Betriebswirtschaft, 2008, vol. 58, no. 1, pp. 21–51. · doi:10.1007/s11301-008-0033-7
[2] Parragh, S., Doerner, K., and Hartl, R., A Survey on Pickup and Delivery Problems. II. Transportations between Customers and Depot, J. Betriebswirtschaft, 2008, vol. 58, no. 2, pp. 81–117. · doi:10.1007/s11301-008-0036-4
[3] Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., and Laporte, G., Static Pickup and Delivery Problems: A Classification Scheme and Survey, TOP, 2007, vol. 15, no. 1, pp. 1–31. · Zbl 1121.90001 · doi:10.1007/s11750-007-0009-0
[4] http://neo.lcc.uma.es/radi-aeb/WebVRP/ .
[5] http://www.idsia.ch/monaldo/vrp.html .
[6] http://www.sintef.no/static/am/opti/projects/top/vrp/index.html .
[7] http://rain.ifmo.ru/cat/view.php/theory/unsorted/vrp-2006#cvrp .
[8] Usenko, I.V., A Survey of Decision Making Problems under Uncertain and Fuzzy Conditions for Solving Transportational Problems, Perspekt. Inform. Tekhnologii i Intel. Sistemy, 2008, vol. 34, no. 2, pp. 37–44.
[9] Mukhacheva, E.A. and Rubinshtein, G.Sh., Matematicheskoe programmirovanie (Mathematical Programming), Novosibirsk: Nauka, 1987.
[10] Eremin, I.I. and Astaf’ev, N.N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya (Introduction to the Theory of Linear and Convex Programming), Moscow: Nauka, 1976.
[11] Lovasz, L. and Plummer, M.D., Matching Theory, Budapest: Akademiai Kiado, 1986. Translated under the title Prikladnye zadachi teorii grafov. Teoriya parosochetanii v matematike, fizike, khimii, Moscow: Mir, 1998.
[12] Dantzig, G.B. and Ramser, J.H., The Truck Dispatching Problem, Manage. Sci., 1959, vol. 6, no. 1, pp. 80–91. · Zbl 0995.90560 · doi:10.1287/mnsc.6.1.80
[13] Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translatedn under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
[14] Laporte, G., The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms, Eur. J. Oper. Res., 1992, vol. 59, pp. 231–248. · Zbl 0760.90089 · doi:10.1016/0377-2217(92)90138-Y
[15] Ralphs, T.K., Kopman, L., Pulleyblank, W.R., and Trotter, L.E., Jr., On the Capacitated Vehicle Routing Problem, Math. Progr., 2003, vol. 94, pp. 343–359. · Zbl 1030.90131 · doi:10.1007/s10107-002-0323-0
[16] Toth, P. and Vigo, D., Branch-and-bound Algorithms for the Capacitated VRP, Vehicle Routing Problem, 2001, SIAM, pp. 29–51. · Zbl 1076.90554
[17] Handbook of Discrete and Combinatorial Mathematics, Boca Raton: CRC Press, 2000.
[18] Clarke, G. and Right, J.W., Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Oper. Res., 1963, vol. 11, pp. 568–581.
[19] Spasovic, L., Chien, S., and Kelnhofer-Feeley, C., A Methodology for Evaluating of School Bus Routing-A Case Study of Riverdale, in Jersey Transport. Res. Board 80th Annual Meeting, January 7–11, 2001, Washington, TRB Paper no. 01-2088.
[20] Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1975.
[21] Sotskov, Yu.N., Strusevich, V.A., and Tanaev, V.S., Matematicheskie modeli i metody kalendarnogo planirovaniya (Mathematical Models and Methods of Calendar Planning), Minsk: Universitetskoe, 1994.
[22] Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978. · Zbl 0321.94011
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.