Resumen de On the air trafic flow management problem: A deterministic model
Alba María Agustín Martín, Antonio Alonso Ayuso, Laureano Fernando Escudero Bueno, Pablo Olaso Redondo, María Celeste Pizarro Romero
In this work we develop a deterministic version for an air trac ow management problem (ATFP) on a short term policy. The problem objective is to decide, for each aircraft that takes o from a departure airport and lands in an arrival airport, which is the route to follow, between some given sectors, how much air and ground holding units delay would have and cancellation, if any, according to company priorities. We consider problem restrictions due to capacities of departures and arrivals in airports and the number of airplanes that may y within a sector, at a given time. Mathematically we consider an air network and divide it on a set of sectors. The nodes of the network are the airports and the points where each ight changes sector, the links are the connection between those nodes that form a possible route. Therefore, alternative routes to the principal one are allowed. The problem is modeled as a tight large-scale pure 0-1 model. Some computational experience is reported.
