Study On Scheduling Problem Of Airport Special Vehicle

At present,the scheduling way of special vehicles is manual at most of airports.Scilicet,when one task appears,the people dispatch a free vehicle from the depot to perform the task,and to return the depot after completing this task.But this scheduling way is less efficient,and does not take into account optimizing the path,it will easily lead to delay flight.In order to efficiently complete the various types of ground support services mission,we need the intelligent scheduling of special vehicles.First,the static scheduling: based on the study of vehicle routing problems in the past,we choose the savings value algorithm and the improved nearest neighbor algorithm which are suitable for this problem to optimize the path.And in order to solve the problem of unbalanced task allocation among vehicles,we designed the allocation algorithm based on the sequence in time,and defined the task balance to measure the merits of the distribution results.In order to verify the rationality and validity of the above design theory,experiments were carried out on the actual cases such as fuel trucks and luggage trailers,in which the former was a general one-way problem and the latter was a two-way problem.The experimental results show that compared with the manual scheduling,the scheme can save the total distance of the vehicle,and the task allocation is basically balanced.The required trips can also be greatly reduced to achieve the goal of multi-objective optimization.The program is more suitable for flight planning is predictable,and basically no change in the situation.Second,the dynamic scheduling: as the flight vulnerable to various types of uncertainty factors are delayed or canceled,ahead of the planned path program may fail,need to timely adjust and respond.Aiming at the dynamic change of flight plan,a real-time vehicle scheduling algorithm based on planning time window is designed,and the method of static scheduling is inherited.The dynamic problem is transformed into several static problems.The experimental results show that compared with the manual scheduling,the optimization effect of the scheme is obvious,and the multiple optimization targets can be taken into account at the same time.Compared with the static scheduling scheme,the solution quality of the scheme is better than that of the static scheduling scheme.Although slightly lower,but to meet the needs of real-time response,more suitable to solve practical problems.