Article ID: | iaor2007298 |
Country: | Netherlands |
Volume: | 143 |
Issue: | 1 |
Start Page Number: | 191 |
End Page Number: | 202 |
Publication Date: | Mar 2006 |
Journal: | Annals of Operations Research |
Authors: | Marn ngel G. |
Keywords: | programming: network, vehicle routing & scheduling, programming: branch and bound |
The Taxi Planning studies the aircraft routing and scheduling on the airport ground. This is a dynamic problem, which must be updated almost every time that a new aircraft enters or exits the system. Taxi Planning has been modelled using a linear multicommodity flow network model with side constraints and binary variables. The flow capacity constraints are used to represent the conflicts and competence between aircraft using a given airport capacity. The ‘Branch and Bound’ and ‘Fix and Relax’ methodologies have been used. The computational tests have been run at the Madrid–Barajas airport, using actual data from the airport traffic.