CC BY
51
UDC 519.711.2
On Transport Task with Due Regard to Real Requirements A. I. Blinov, I. L. Tolmachev
Information Technology Department Peoples' Friendship University of Russia 6, Miklukho-Maklaya str., Moscow, Russia, 117198
The cargo transportation volumes increase annually all over the world. Transportation companies face a very difficult task concerning the definition of the optimal routing and vehicle loads. Such task is known as Vehicle Routing Problem (VPR). The application of the classical approach to the task description is quite complicated due to the fact that it does not take into account a lot of parameters which define the crucial criteria of the successful operation of the company such as: consideration of the vehicle characteristics and characteristics of the cargo to be transported, variety of depots and open route, the possibility of partial loading/unloading of the vehicle at the itinerary points, transportation of cargo which consists of various goods, consideration of the service priority of the point. So the article deals with the complex transportation task. Actual local features for transport enterprises were found out. The article also contains the formulation of the problem for wide-spread practical applications, the mathematical model of the complex transportation task.
Key words and phrases: transportation task, vehicle routing problem, transportation routing, transport flow, heuristic methods.
1. Introduction
Currently in the environment of the society development we face the constant growth of goods production, which causes the increase of general goods turnover. The increase of the latter provides an impact on the development of the business that is connected with transport logistics and expediting: supply chains become more complicated, the number of transport units grows rapidly and the availability of the goods also increases. Nowadays it's quite possible to receive goods in any country of the world due to the developed transport network and well-coordinated work of transportation companies.
As of today within this sphere the business has to deal with the list of tasks which require some competent solution based on modern mathematical models. The major and the most difficult task is the development of the optimal procedure for the goods delivery from the point of departure to the point of destination by making use of the vehicle fleet. For small transportation companies which possess several vehicles this task can be successfully solved manually during a short period of time, but should there be significant volumes and significant number of vehicles the employees of the company face a very complicated task related to the development of the optimal routing and optimal load of vehicles.
Such kind of task is well known as Vehicle Routing Problem. VRP appeared to be complex combinatorial problem and it relates to NP-class task [1]. Actually the VPR provides the solution of two well-studies tasks:
— Traveling Salesman Problem (TSP);
— Bin Packing Problem (BPP).
Classical definition of the task does not take into account the local peculiarities of the transportation companies' work, and this provides some obstacles for the practical application of this task within the environment of real business procedures. Therefore, this article analyses the main tasks of logistics companies and represents the most acute necessities of the task definition.
Received 10th December, 2013.
2. Classical Definition of the Vehicle Routing Problem
Definition: the Vehicle Routing Problem deals with the development of circular routes for several vehicles, which shall pass through the provided quantity of target points, provided that all routes shall start and end in one point called depot. Each target point shall have only one route passed. The target of the task is to minimize the total cost of the completion of the routes.
Mathematical definition of the classical VRP [1-3]:
1. G(V, E) — the graph with the set of target points (V) and lines (E);
2. V = {v,v1,... ,vn] — the variety of target points, where v — is a depot (the target point where all routes start and end);
3. V' = V\{u] — the variety of n-target points;
4. C — the matrix of transportation costs between the targets points, where Cij — stands for the cost of transportation between the target points Vi and Vj;
5. m — number of vehicles;
6. Ri = {vi,vj, Vk,....] — route of the «-vehicle;
7. (CRi) — the cost of route Ri;
8. the task of routing represents the development of such variety of routes with minimal total cost, so that every target point from the ^-variety shall be visited by one vehicle and only once. All routes shall start and end in the depot. Target
m
function is Y1 C№) ^ min.
i=1
3. Local Peculiarities of VRP
The analysis of the companies dealing with transport logistics and expediting shows that almost all companies can be divided into three groups, provided that the major criteria of such classification is the scope of services provided to the clients:
- Large international companies which deal with multimodal transportation services and which are using different transportation means for this purpose (railroad transport, air transport, sea transport, automobile transport and other).
- Regional companies which deal with cargo transportation within one macro region/country.
- City companies which ensure the collection / delivery of cargo within one city or small district. Internet shops, chains of food and non-food stores and other enterprises can be included into this category.
This article puts an emphasis on the regional and city type of companies because as a rule the multimodal transportations are planned by the experts with due regard to a number of parameters which are based on totally different limitations.
Let's have a closer look at the operational stages of regional transportation companies:
- the first step of the supply chain is the collection of the cargo from the customers and its delivery to the distribution centers; in such centers the goods are distributed in accordance with regions of delivery, after that the vehicle fleet is formed from the vehicles which are currently at company's disposal;
- then as a rule the goods are delivered to the large transshipment points (warehouses) meant for loading/unloading, here several routes may be combined within one vehicle, due to this action the delivery distance shortens and the costs for VRP's solution decrease correspondingly;
- the third step stands for the delivery of goods from transshipment points to customer's cities and after that the city companies start their work.
It can be noticed that the transport routing task is solved at every step individually.
Further let's study the steps of transportation performed by city transportation companies:
- the first step is the collection of the cargo from one or several warehouses (plants);
- the second step stands for the actual delivery of cargos to the final customer (shops).
Having analyzed the necessities and physical limitations of regional and city transportation companies it's possible to make the following conclusion — the working methods of the most companies which deal with transport logistics are very similar, that is why it's possible to develop universal algorithm for the solution of VRP for different companies. The differences between companies lay in the value of specific parameters which influence the speed and calculation quality of the transportation routes and also in some physical limitations and delivery limitations.
Taking into consideration all above mentioned this article reveals the most up-to-date local peculiarities of the task
3.1. Consideration of the Vehicle Characteristics and Characteristics of
the Cargo to be Transported
In the classical definition of the task only homogeneous transport is used, so that in order to fulfill the classical task it's necessary to have the vehicle fleet which consists of the same vehicles.
Each vehicle is characterized by the set of parameters: overall dimensions of the vehicle body and/or overall volume, cargo capacity, list of goods allowed to be transported. The introduction of this peculiarity is connected with physical difference of the transportation means and this peculiarity constitutes an integral part of the task solving. The loading of the vehicle with the cargo which physically cannot be placed on the vehicle due to its weight, dimensions or incompatibility with other cargos has no sense because the solution of VRP will be physically impossible.
It's necessary to draw the attention to the fact that vehicle can be characterized by operating costs also, within these costs the major part is taken by fuel consumption. Due to that, additional parameter, namely transportation costs for 1 km, was added to the characteristics of the vehicle.
There are two characteristics which are very important for the transported cargo, namely these are weight and volume. Exactly these two parameters are to be introduced to the VRP definition as additional parameters.
3.2. Variety of Depots and Open Route
As a rule logistics companies use their own and rented vehicles which can be dispersed across the territory and can be part of different transport fleets. Very often the situation occurs when the owner of the vehicle is the physical person, so that it means absolutely free dislocation of the vehicles. Due to these factors the actual peculiarity of the task definition is the presence of depots variety, herewith the starting point can be comprised of several places most often these are to be warehouses.
Besides, the return of the vehicle without a cargo to the depot appeared to be profitless activity. This factor shall be taken consideration because it has a crucial importance for the working procedure as it significantly decreases the expenditures of the transportation companies meant for the cargo transportation. Thus, the ability of VRP to build up an open route is in a high demand, because of the departure and arrival points of the vehicle may not coincide.
The definition of the task, taking into consideration this peculiarity, prescribes that the number of depots shall be less or equal to the number of vehicles. So, at the start time each vehicle may be placed at some particular itinerary point or it can represent the autonomous point where loading/unloading procedure does not take place; there is no direct link between the vehicles in the distance matrix. Additional parameter shall be added to each vehicle which should characterize the necessity of vehicle return to the departure point and sometimes it causes the solving of the travelling salesman problem.
3.3. The Possibility of Partial Loading/Unloading of the Vehicle at the
Itinerary Points
This peculiarity covers only the clients who are dealing with transportation of consolidated cargos, it means that the carrier can either collect the cargo and transport it to the warehouse or collect the cargo from the warehouse or from the other clients during the execution of its itinerary route. For example, big chain stores can redistribute the goods between the selling points depending on the demand during particular time period. Regional companies may use this peculiarity to redistribute the cargos between vehicles at itinerary points — warehouses meant for cargo batching.
In order to be able to use this supplement to the definition of VRP definition each itinerary point shall have two sets of characteristics, these are cargos to be dispatched from the point and the goods to be collected.
It should be mentioned that in case of such VRP definition the necessity of cargo redistribution appears, because the necessity of itinerary points can be satisfied by several means, this is connected with the fact that the goods which are required at the point may be located in different places.
3.4. Transportation of Cargo which Consists of Various Goods
In the classical definition of the task only one type of goods is used for transportation needs, very often it does not confirm with the reality, because the cargo to be transported can be quite different. It is stipulated that most often the transportation of grouped cargos takes place, which means that one cargo includes goods from different manufacturers which were collected in the united distribution centers.
Due to that fact such goods characteristics as designation (code), weight, volume and type of goods are used in the definition of the task.
3.5. Consideration of the Service Priority of the Point
As in this task definition we consider non-homogeneous goods and limited number of vehicles, in terms of service provision for the points, it's necessary to take into account the priority of these points' visiting during particular time period. This is stipulated by the limited durability of goods, time prescribed by the execution of order and other factors. As the number of vehicles is limited, sometimes it's not possible to visit all itinerary points within particular period of time. The service prioritization can be applied as a solution to this problem.
This article does not concentrate on the semantics of the concept "priority". For food commodities "priority" may mean the propinquity of the selling due date of the goods (0 — the goods are in the warehouse, 1 — the goods are to be written-off), for industrial commodities, for example, "priority" may stand for seasonal necessity to change the goods. The determination of the priority concept can be widened in order to meet the needs of each enterprise individually.
It means that at every itinerary point each cargo has its own service priority in terms of acceptance / consignation.
The introduction of service priority allows decreasing the total costs of cargo transportation. Such target may be achieved due to addition of the cargos with lower priority to the vehicles which are not loaded to the full, therefore the price of 1 km transportation will increase insignificantly, but the effect of economical growth appeared to be quite sufficient.
3.6. Interconnection with Transport Task
Taking into account everything above said, it shall be mentioned that such definition of the task represents the combination of two tasks: the transport task in its classical definition and transport routing task. The first task focuses on the distribution of the goods between the points, the second task deals with development of the
optimal routes for particular vehicles. Let's have a closer look at the classical task definition:
Definition: transport task — to develop optimal transportation plan of a homogeneous goods from homogeneous points of departure to homogeneous points of destination.
Mathematical definition of classical transport task [4]:
1. A1, A2,..., Am — points of departure;
2. B1,B2,.. .,Bn — points of destination;
3. C — price matrix, where Cij is the cost of transportation of the cargo unit from «-point of departure to j-point of destination;
4. a,i — stock of goods in the «-point of departure;
5. bj — demand for goods in the j-point of destination;
6. X — transportation matrix, where Xij stands for number of cargo units which are to be delivered from «-point of departure to j-point of destination;
7. the target: it's necessary to meet the customers' demand with the warehouse stock under condition of minimizing of transportation costs. Target function
m n
F = ^ ^ djXij ^ min.
i=1 j=1
Let's have a look at the complex transport task. The first stage of task solution shall be the creation of consigners' orders which will define the list of goods to be delivered, points of departure and points of destination, date of departure and delivery of the goods. The second stage stipulates the development of routes which will include parts of orders in case it's not possible to locate the full order within one vehicle or several full orders, if these are small orders which can be placed together on one vehicle. During the execution of the itinerary route the vehicle can whether unload the cargo at the itinerary points or load it.
The separation of these tasks limits its application, so for the purpose of finding solution for the wider spectrum of cargo transportation tasks it appears to be reasonable to consider these tasks as a complex. It should be taken to consideration that with the help of complex transportation task it's possible to decrease the transportation costs significantly, because sometimes the solution found for the task will be economically efficient.
It shall be mentioned that the definition of the task described in this article stipulates the consideration of several kinds of transport tasks.
If the limitation for itinerary routes is eliminated, the task transforms into the transport task where each itinerary point can act whether as a consigner or as a consignee.
If the limitation for the homogeneity of goods is eliminated, the task transforms into multi product transportation task where every itinerary point can whether contain or demand several different goods.
Due to above mentioned facts we face the necessity to describe the transport task which includes the routing task and which uses the variety of local peculiarities of two tasks in order to draw the task denomination closer to real life.
4. The Definition of a Complex Transport Task
Let's describe the complex transport task with the help of the following - V, A, T, C, R:
1. V = {v1,.. .,vn] — the variety of point for acceptance and dispatching of the goods. For each point the following information is given Vi = Vi (tOi,m,tii,m, ai,t), where tOi,m = tOi,m(tn,tk,p), tii,m = tii,m(tn,tk,p), such information represents the goods to be collected and dispatched. Therefore, each goods tn have the following characteristic number of packing tk and the level of urgency (priority) p G (0,1). ai,t is the variety of vehicle which currently locates at this point.
2. A = {a1,..., ak] — stands for the variety of vehicles where each element characterizes the ability of the vehicle aj = aj (xj ,Sj ,abj). The index Xj contains
the information about the cargo allowed to be transported, working load and the volume of the vehicle storage space. Sj is the cost of passage of 1 km distance, besides, the load level is taken into consideration: empty vehicle, half volume, full load, not available (during the execution of the route, or at the repair station), abj — the index, which shows the necessity of the vehicle return to the starting point after the completion of the route.
3. T = {t1,.. .,tm] — characteristics of goods which are to be transported. tp = tp(tn,tm,tv,tt), where tn — designation (code), trn — weight of the packing, tv — volume of the packing, tt — type of goods.
4. C = (ci1,i2) — the cost of time-independent goods transportation from point i1 to point i2. Thus the cost of transportation comprises the cost of time-independent goods transportation multiplied by the cost of the vehicle transfer.
5. R = {r1,.. .,rs] — vehicle routes, where ri = {0,..., vc,.. .,vi,..., 0] — sequence of points passage.
In this model the definition of VRP task shall be changed as follows.
According to the requirement concerning the changes of the goods content, it's essential to meet the requirements of the itinerary points with priority degree which is over some value p* during particular period of time under condition of minimization of the total transportation cost due to development of vehicle routes.
The target function of the task is the development of such routes R which will ens
sure minimum cost of the itinerary points passage, so that Y1 &(ri) ^ min, therefore
i=1
the delivery of goods with priority level higher than p* is ensured.
It should be mentioned that when p* takes its minimal value within the spectrum of positive value of p, the task will appear to be enlarged transport task which can meet the requirements of all itinerary points.
5. Conclusion
Within the environment of constant increase of cargo flow the solution of transport routing task and transport task in its classical representation is quite important nowadays. During previous 50 years a lot of methods aimed at solving of such kind of tasks have been developed [2,3,5-7]. Nevertheless the problem of enterprises which deals with transport logistics remain as acute as it used to be before. This situation can be explained by the fact that the classical definition of the task very often cannot be applied in real life because it does not take into account a lot of peculiarities of the real working conditions of the companies, which every day face the challenge concerning the development of optimal way to satisfy the needs of the customers.
This article presents the analysis of requirements of the companies, and it provides the task definition which meet the most up-to-date needs of the transportation companies, and which takes into account physical aspects of their work, business procedures of the enterprise and also all the limitations prescribed by the legislation and other factors which influence the activity of the companies working within this domain.
References
1. Toth P., Vigo D. The Vehicle Routing Problem // SIAM Monographs on Discrete Mathematics and Applications. — Philadelphia, USA, 2002.
2. Clarke G., Wright J. W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points // Operations Research. — 1964. — Vol. 12. — Pp. 568-581.
3. The VRP Web. — http://neo.lcc.uma.es/vrp/.
4. Villani C. Optimal Transport, Old and New. — Book Manuscript, 2006.
5. Osman I. H. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem // Ann. Oper. Res. — 1993. — Vol. 41.
6. Johnson D. S., McGeoch L. A. The Traveling Salesman Problem: A Case Study in Local Optimization. Local Search in Combinatorial Optimization. — N. Y.: John Willey & Sons, 1995.
7. Solving Vehicle Routing Problems using Constraint Programming and Metaheuris-tics / B. D. Backer, P. Kilby, P. Prosser, P. Shaw // Journal of Heuristics. — 2000. — Vol. 6 (4). — Pp. 501-525.
УДК 519.711.2
О транспортной задаче с учётом реальных требований А. И. Блинов, И. Л. Толмачёв
Кафедра информационных технологий Российский университет дружбы народов ул. Миклухо-Маклая д. 6, Москва, Россия, 117198
Ежегодно можно наблюдать увеличение объёма транспортировки грузов по всему миру. Перед транспортными предприятиями стоит нелёгкая задача определения оптимального решения маршрутизации и загрузки транспорта. Данная задача известна как задача маршрутизации транспорта. Применение на практике классической постановки задачи затруднительно, потому как в ней не учтены многие параметры, определяющие важные критерии для успешной работы компаний. В связи с этим в работе рассмотрена комплексная транспортная задача. Были выявлены актуальные локальные особенности транспортных предприятий, такие как учёт характеристик транспортных средств и перевозимого товара, множество депо и незамкнутый маршрут, возможность частичной загрузки/разгрузки транспортной системы в пунктах следования, транспортировка мульти номенклатурного груза, учёт приоритета обслуживания пункта. Описана наиболее востребованная для практического применения постановка задачи, предложена математическая модель комплексной транспортной задачи.
Ключевые слова: транспортная задача, задача маршрутизации транспорта, маршрутизация перевозок, транспортный поток.
