Research on Airport Refueling Vehicle Scheduling Problem Based on Greedy Algorithm

Aiming at airport refueling vehicle scheduling problem (ARVSP), the mathematical model with time window constraints is established. Firstly, considering the distance between refueling vehicle and flight, and in view of the influence of flight refueling service time windows on service flight selection, an evaluation function is designed to achieve the least total vehicle distance and the minimum required vehicle. And then based on the evaluation function, a greedy algorithm is proposed to solve airport refueling vehicle scheduling problem. Finally, the correctness and effectiveness of the proposed model are verified by a practical case of airport refueling vehicle scheduling problem.