Article ID: | iaor20124325 |
Volume: | 63 |
Issue: | 8 |
Start Page Number: | 1116 |
End Page Number: | 1125 |
Publication Date: | Aug 2012 |
Journal: | Journal of the Operational Research Society |
Authors: | Norin A, Yuan D, Granberg T A, Vrbrand P |
Keywords: | scheduling, combinatorial optimization, vehicle routing & scheduling |
Most delays in the air transport occur at the airport. A particular reason is the complexity of managing the large number of supporting flows in airport logistics. We consider the optimisation problem of scheduling de‐icing vehicles that is one of the key supporting logistic flows in the turn‐around process of aircraft. The objective is to minimise the delay of flights due to de‐icing, and the travel distance of the de‐icing vehicles. We study the complexity of the problem, and develop a solution algorithm using greedy randomised adaptive search. A case study of real‐life data from Stockholm Arlanda Airport shows that optimised schedule leads to significantly better performance in comparison to intuitive and simple scheduling strategies. The benefit of optimisation in reducing the waiting time for de‐icing is further demonstrated via dynamic simulations.