Mathematical model for optimising the sequence for clearing snow from the manoeuvring area during winter operations

Abstract

SummaryThis article considers the optimisation of the sequence for clearing snow from stretches of the manoeuvring area of an airport. This issue involves the optimisation of limited resources to remove snow from taxiways and runways thereby leaving them in an acceptable condition for operating aircraft. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are established during which these are open to aircraft traffic. The document contains several mathematical models each with different functions, such as the end time of the process, the sum of the end times of each stretch and gap between the estimated and the real end times. During this process, we introduce different operating restrictions on partial fulfilment of the operational targets as applied to zones of special interest, or relating to the operation of the snow‐clearing machines. The problem is solved by optimisation based on linear programming. The article gives the results of the computational tests carried out on five distinct models of the manoeuvring area, which cover increasingly complex situations and larger areas. The mathematical model is particularised for the case of the manoeuvring area of Adolfo Suarez Madrid—Barajas Airport. Copyright © 2016 John Wiley & Sons, Ltd. Highlights Optimal sequence for clearing snow from the manoeuvring area of an airport. Contains optimising algorithms solved using CPLEX LP‐based tree search. Restrictions on partial fulfilment of operational targets applied to subsets of significant stretches, used for planning the operation of snow‐clearing machines. Model applied to the case of the manoeuvring area of Adolfo Suárez Madrid Barajas Airport. Conclusions are given on the results of the computational tests carried out. There are five models of the manoeuvring area which cover increasingly complex situations and larger areas.