A Scheduling Algorithm Applied to Multiple Vehicles

Abstract

The invention discloses a dispatching algorithm applied to multi-travel vehicles. Firstly, the traffic dispatching area probabilities of different areas are determined in the overall space in which multi-travel vehicles carry goods, and the overall space is divided into the same areas as the number of traffic vehicles according to the number of traffic vehicles. According to the probability of the traffic dispatching area, the traffic dispatching area is divided into several areas with different probabilities; according to the current coordinate position of the traffic, combined with the physical coordinates of the goods to be transported, calculate the relationship between each piece of goods to be transported in this area and each traffic in the entire space When there are multiple goods to be transported in an area, the goods to be transported are moved according to the priority scheduling method. This algorithm comprehensively considers the task scheduling time, the frequency area where the task occurs, and the allocation of driving resources. An important factor to balance scheduling requirements for time and efficiency. When dispatching traffic, select the traffic with the highest priority among all available traffic for scheduling, and allocate traffic resources reasonably.

Description

technical field [0001] The invention relates to the field of driving, in particular to a scheduling algorithm applied to multiple driving. Background technique [0002] In the existing technology, algorithm technology mainly solves the matching optimization problem between driving and goods in the workshop scheduling operation, so as to minimize the execution time of a single task, the average waiting time of the overall task, and improve the scheduling efficiency. In the dispatching of trains, efficient dispatching is achieved through the use of algorithmic logic. The scheduling matching between driving and goods has its unique characteristics. For example, each batch of goods is almost different, and the transportation time and mode of transportation are also different. At the same time, the goods also have requirements for driving, and the selection of driving at different times and routes is also different. . [0003] At present, first-come-first-serve algorithm and sh...

AI Technical Summary

Problems solved by technology

Before each task in the short-distance algorithm starts to execute, it is necessary to judge the vehicle with the closest distance to the task in advance, and then evaluate the resource allocation of the vehicle according to these distances, and select the vehicle with the closest distance to the task for priority execution. The trucks that frequently go out of the warehouse are always working, while the trucks with a low probability of going out of the warehouse are always in an idle state, and the resource allocation is seriously unbalanced.

[0006] At the same time, in a production environment without a dispatching system, the dispatching of traffic is carried out manually, which greatly increases the cost of personnel, and the timeliness of processing depends on the working ability and attitude of the employees. Uncertain factors often lead to long time-consuming , high cost, low efficiency and other issues

In the scheduling of traffic, it is feasible to use first-come, first-served or short-distance scheduling for simple single-lane and double-lane traffic, but for multi-travel scheduling, it is impossible to use first-come, first-served or short-distance single priority scheduling. To achieve optimal scheduling

Images