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. <...> 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. <...> 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. <...> 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. <...> 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 <...>