OVERVIEW OF THE DIFFERENT TYPES OF VEHICLE ROUTING PROBLEM
Abstract
Logistics in modern conditions is one of the most effective factors to improve the efficiency of the economy. Like other traditional management functions, it focuses on promising information technology, economic and mathematical methods and models to ensure compliance of management decisions constantly changing internal and external business conditions. To a greater extent, this is relevant for the theory of organization and functioning of logistics systems (processes) involved in the management of material flows and stocks, which tend to constant growth. Currently, due to the increase in freight traffic, an urgent problem is the development and development of methods for solving routing problems, the main purpose of which is to reduce the cost of transportation and delivery of various goods to consumers «just in time». In recent years, with the development of trade networks, the growth of the population of large cities, the development of transport infrastructure in Kazakhstan, the development of new effective information and computing technologies to optimize the structure of regional transport is becoming more widespread. Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. VRP is directly related to Logistics transportation problem and it is meant to be a generalization of the Travelling Salesman Problem (TSP).
About the Authors
A. A. KuandykovKazakhstan
G. Ye. Bayekova
Kazakhstan
References
1. Clarke, G., Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12 (4), 568581.
2. Dantzig, G. B., Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6 (1), 8091.
3. Kosheev I. S. Optimization of delivery of cargo to consumers taking into account its placement in vehicles on the basis of heuristic methods // 2015 UFA
4. Pojidaev M.S. Algoritmy resheniya zadachi marshrutizacii transporta. Diss.Tomsk, 2010. - 135 p.
5. Toth, P., Vigo, D. (2014). Vehicle routing: Problems, Methods and Applications, Second Edition. Philadelphia: SIAM.
6. Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 1 (March), pp. 158-165 // Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem P. C. Pop, C. Pop Sitar, I. Zelina, V Lupse, C. Chira
7. Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, 43 (4), 408416.
8. C. Barnhart and G. Laporte (Eds.), Handbook in OR & MS, Vol. 14 Copyright © 2007 Elsevier B. V All rights reserved DOI: 10.1016/S0927-0507(06)14006-2 // Chapter 6 Vehicle Routing Jean-Franc̦is Cordeau, Gilbert Laporte , Martin W. P. Savelsbergh , Daniele Vigo
9. Beresneva E., Avdoshin S. Analysis of Mathematical Formulations of Capacitated Vehicle Routing Problem and Methods for their Solution. Trudy ISP RAN/Proc. ISP RAS, vol. 30, issue 3, 2018, pp, 233-250
10. Vasyanin V. A., Ushakova L. P. The task of building delivery and Assembly routes melkoprosejannyj of goods in the internal zones of the hierarchical road network
Review
For citations:
Kuandykov A.A., Bayekova G.Ye. OVERVIEW OF THE DIFFERENT TYPES OF VEHICLE ROUTING PROBLEM. Herald of the Kazakh-British technical university. 2019;16(3):264-269.