The optimization technique of highway trucks fleet joint schedule with time limits

Abstract

The article deals with the problem of operative management of highway road trains fleet, which performs freight traffic. To increase the efficiency of their use, precise interaction of customers and road trains is required. The tasks of compiling unitary schedules for a fleet of freight road trains that interact, and their limited to time windows use is arose recently. With the knowledge of total volume of orders on the transport network, it is even more urgent to rapidly compile routes for this group of vehicles, which should minimize an idling. Since such requirements are contradictory the optimization problems are formulated and solved. A methodology for compiling a unitary schedule is proposed, which allows one to take into account the limitations on the overall duration of the implementation of known transport orders, temporary tolerances for each of them in particular. This reduces the initiating and idle runs of the rolling stock to an acceptable level. The methodology takes into account the number, carrying capacity and location of the trucks fleet at the moment of their scheduling. Orders for transportation are unique here. Indivisible shipments of cargo intended for transportation on pendulum routes. It was assumed that the productivity of a fleet is unknown beforehand therefore, by scheduling we have the opportunity to choose the most profitable of orders. In addition, if the planning period is sufficiently large (large volume of forecast orders), then to increase the reliability and accuracy of the results, it can be broken down into smaller cycles. A solved problem similar to that is referred to NP or NP-strong in the theory of operations research. The proposed methodology is based on an algorithm which allows to obtain an approximate solution with an estimate of the accuracy of its error. A modified method for ordering mixed graphs is applied. The main feature of the algorithm is that the model of the initial undirected graph is dynamic one. Its vertices are events its connections are edges and Серія: Технічні науки 300 arcs which have a constant and variable component of duration. They also reflect the cyclical nature of the entire project which can be more easily controlled. So, due to the fact that it is possible to change the tolerance for the total duration of the project and the initial number of cars a satisfactory permissible active schedule is achieved. The algorithm is simple for use with regard to its analogs. Therefore, for small amounts of initial data it can be used without computer. A computer program is written for large arrays that has a convenient interface and can be used in the dispatch systems of automobile transport enterprises.

Authors and Affiliations

H. Prokudin, M. Oliskevich

Keywords

Related Articles

Method of automated detection of abusive content in social media text messages

The work provides the analysis of specifics of web users’ communication. Special attention is paid to the communication in social media and, in particular, to the problem of detection of abusive content in social media u...

Research of electrodynamics characteristics of antennas in the form of an open end of a rectangular waveguide with partial dielectric filling and excitation pin

The electrodynamics characteristics of the antenna in the form of an open end of a rectangular waveguide with partial dielectric filling and a pin of excitation are studied. In the antennas in the form of an open end of...

Research of methods of identification and determination of parameters of movement of vehicles in the system of access to a closed object

Security in our country and abroad requires the search for new information technologies to protect and secure facilities from unauthorized access. The protection of objects of national importance is especially urgent. Th...

Justification of evaluation criteria of the effectiveness of choice of spare parts stored in the warehouse of the transport company to maintain in good condition of its rolling stock

Support rolling stock of transport in good repair can be carried out using replacement parts that are stored on in the warehouses of transport enterprise and spare parts that are purchased as the need arises. For the uni...

Determination of rational conditions of application of rock layered milling combines on iron ore pits

The method of determining the effective use of milling type surface miners for the use of non-blasting technology of layer milling of rocks during open exploration of iron ore deposits has been improved. The non-blasting...

Download PDF file
  • EP ID EP420440
  • DOI -
  • Views 145
  • Downloads 0

How To Cite

H. Prokudin, M. Oliskevich (2018). The optimization technique of highway trucks fleet joint schedule with time limits. Вісник Житомирського державного технологічного університету. Серія: Технічні науки, 82(2), 118-126. https://europub.co.uk/articles/-A-420440