Loop bus scheduling optimization method with release time

Abstract

The invention provides a loop bus scheduling optimization method with release time. The method comprises steps of sorting non-running shifts in all loop buses by adopting a method of combining an FCFSprinciple and an SPT principle, and selecting idle vehicles to run; then selecting a vehicle in an unopened state as a to-be-operated vehicle to execute a to-be-operated shift, marking the to-be-operated vehicle as an idle vehicle when the to-be-operated shift is completed or the to-be-operated vehicle cannot continue to operate due to waiting for a certain event, and marking the to-be-operated shift as an operated state after the operation is completed; secondly, judging whether all shifts are arranged in a running state or not; and finally, enabling the bus control system to output the number of all started vehicles, and finishing scheduling of the loop bus system. According to the method, the problem of loop bus scheduling is effectively solved by adopting a method of combining the FCFS and the SPT, shift scheduling and vehicle scheduling of companies are facilitated, the operation cost is saved, and the method has a considerable application value.

Description

technical field [0001] The invention relates to the field of production scheduling, in particular to an optimization method based on loop bus scheduling with release time. Background technique [0002] With the development of society and science and technology, loop buses are widely used in cities. For the starting station of loop buses, there will be several shifts that need to be scheduled. Every bus company hopes to use the least possible bus. Vehicles run the most shifts, so how can the bus company arrange shifts to achieve what it wants to the greatest extent possible? This is a very typical loop bus scheduling problem. At present, the scheduling problem of loop buses is still a relatively novel problem, and no optimal method was given to solve the problem of minimizing the maximum number of vehicles in the previous bus scheduling. Contents of the invention [0003] The technical problem to be solved in the present invention is aimed at the deficiencies of the above...

AI Technical Summary

Problems solved by technology

At present, the scheduling problem of loop buses is still a relatively new problem. In the past bus scheduling, there is no optimal method to solve the problem of minimizing the maximum number of vehicles.

Images