Mathematical simulation of the cargoes delivery on an extensive network of automobile roads

Vestnik MGSU 7/2014
  • Khayrullin Rustam Zinnatullovich - Moscow State University of Civil Engineering (MGSU) Doctor of Physical and Mathematical Sciences, Professor, Department of Higher Mathematics, Moscow State University of Civil Engineering (MGSU), 26 Yaroslavskoe Shosse, Moscow, 129337, Russian Federation; This e-mail address is being protected from spambots. You need JavaScript enabled to view it .

Pages 184-191

The problem of calculation of an optimal route is important for companies, including civil engineering companies, wishing to reduce transportation costs of cargoes delivery. The existing regional distribution network of automobile roads is characterized, as a rule, by an extensive network of roads of varying quality, traffic capacity, large distances between consignors and consignees, small warehouse areas, disabled vehicle fleet. In this way companies seek to increased profits by means of solving complex problems such as: reducing the costs of transportation and storage of cargoes, reducing the number of vehicles fleet, using optimal vehicles schedule. Note that in this paper, the term optimal is not used in the strict mathematical sense (optimal - which can’t be improved), but as an established business application in a term describing the effectiveness and efficiency of the process of cost reduction. Common formulation of cargoes delivery optimization problem from consignor to consignee by motor transport is offered. Mathematical models and methods of cargoes delivery on an extensive network of roads are provided. The method consists in gradual solving of three problems: the problem of dividing the region into zones detour in one trip, the traveling salesman problem and the problem of forming a daily job for each unit of vehicle. The software for solving this problem is developed. The software is based on the complex of developed algorithms and standard software tools. The software permits: to calculate the optimal (in terms of transport costs and time costs) routes, schedules and delivery schemes of cargoes from consignor to consignee; to perform the optimal choice of consignor for each consignee by means of calculation of the minimum total cost of the storage and cost of its delivery; to ensure optimal filling of order in time and to ensure a full loading of cargo motor vehicles. Some results of software implementation are described.

DOI: 10.22227/1997-0935.2014.7.184-191

  1. Smirnov M.I., Khayrullin R.Z. Sistema upravleniya dostavkoy tovarov s ispolzovaniem promezhutochnykh skladov [ Management System for Goods Delivery Using Intermediate Warehouses]. Izvestiya RAN. Teoriya i sistemy upravleniya [News of Russian Academy of Sciences. Theory and Control Systems]. 2002, no. 5, pp. 146—151.
  2. Smirnov M.I., Khayrullin R.Z. Matematicheskie modeli, ispol'zuemye v sisteme dostavki tovarov avtotransportom «Dispetcher» [Mathematical Models Used in the «Dispatcher» Automobile System of Goods Delivery]. Preprint Instituta prikladnoy matematiki im. M.V. Keldysha RAN [Preprint of the Institute of Applied Mathematics of the Russian Academy of Sciences Named after M.V. Keldysh]. 2002, no. 13, 22 p.
  3. Khayrullin R.Z. Tekhnologiya issledovaniya upravlyaemykh sistem [Research Technology for Controlled Systems]. Gornyy informatsionno-analiticheskiy byulleten' [Mining Informational and Analytical Bulletin]. 1999, no. 4, pp. 111—113.
  4. Guzairov M.B., Tarasova V.A. Optimizatsiya transportnykh potokov v seti postavok stroitel'nykh materialov [Optimization of Transport Flows in the Construction Materials’ Supply Network]. Sistemy upravleniya i informatsionnye tekhnologii [Control Systems and Information Technologies]. 2008, no. 3.1 (33), pp. 108—112.
  5. Gordienko L.V. Klassifikatsiya pretsedentov pri planirovanii logisticheskikh sistem v srede GIS [Classification of Cases in the Process of Logistics Systems Planning in GIS Environment]. Izvestiya YuFU. Tekhnicheskie nauki. Tematicheskiy vypusk: Gumanitarnye i informatsionnye tekhnologii v upravlenii ekonomicheskimi i sotsial'nymi sistemami [News of Southern Federal University. Technical Sciences. Special issue: «Humanitarian and Informational Technologies in Economic and Social Systems M anagement]. 2008, no. 10 (87), pp. 194—196.
  6. Scholl E.I. Informatsionnoe obespechenie logisticheskikh tekhnologiy [Information Support of Logistic Technologies]. RISK: resursy, informatsiya, snabzhenie, konkurentsiya [RISK: Resources, Information, Supply, Competition]. 2006, no. 1, pp. 12—18.
  7. Kofman A. Vvedenie v teoriyu nechetkikh mnozhestv [Introduction to the Theory of Fuzzy Sets]. Moscow, Radio i svyaz' Publ., 1982, 432 p.
  8. Gorbatov V.A., Smirnov M.I., Khlytchiev I.S. Logicheskoe upravlenie raspredelennymi sistemami [Logical Management of Distributed Systems]. Moscow, Energoatomizdat Publ., 1991, 287 p.
  9. Clement R.P., Wren A. Genetic Algorithms and Bus-Driver Scheduling. Presented at the 6-th International Conference for Computer-Aided Transport Scheduling, Lisbon, Portugal, 1993, 9 p.
  10. Rutkovskaya D., Pilin'skiy M., Rutkovskiy L. Neyronnye seti, geneticheskie algoritmy i nechetkie sistemy [Neural Networks, Genetic Algorithms and Fuzzy Systems]. Moscow, Goryachaya liniya — Telekom Publ., 2006, 452 p.
  11. Reingold E., Nievergelt Yu., Deo N. Combinatorial Algorithms: Theory and Practice. Moscow, Mir Publ., 1980, 476 p.
  12. Papadimitriu Kh., Stayglits K. Kombinatornaya optimizatsiya: algoritmy i slozhnost' [Combinatorial Optimization. Algorithms and Complexity]. Moscow, Mir Publ., 1985, 512 p.
  13. Blekherman M.X. Gibkie proizvodstvennye sistemy: organizatsionno-ekonomicheskie aspekty [Flexible Manufacturing Systems. Organizational and Economic Aspects]. Moscow, Ekonomika Publ., 1988, 110 p.
  14. Wolsey L.A. Integer Programming. New York, John Wiley & Sons, Inc, 1998, 264 p.
  15. Gutin G. Exponential Neighborhood Local Search for the Traveling Salesman Problem. Computers & Operational Research. 1999, vol. 26, no. 4, pp. 313—320. DOI:


Results 1 - 1 of 1