A static algorithm to solve the air traffic sequencing problem

This work contributes to the development of microscopic traffic performance models in the airport. It enhances the existing models and develops new ones. An important contribution of this research is the empirical work, i.e. estimating models using statistically rigorous methods and microscopic data collected from real traffic. With the ever increasing congestion at airports around the world, studies into ways of maximizing infrastructures capacity and minimizing delay costs while meeting the goals of the airlines are necessary. The methodology applied for the calculation of runway capacity start from the traffic data elaboration of the Naples International Airport: we have been determined this aim from the airline pattern in the above airport. The hourly capacity is calculated as the inverse of the headway of consecutive aircraft operation; this is drawn with an average of the time headway in the "critical periods". The determination of the "capacity periods" it happens in three phases: in the first one we are drawn by the sample the stationary periods; in the second we are considered, of these, only those with the lowest averages time headway, these are called "critical" periods; subsequently we are examined only that (critical periods) had time length less than the 60 minutes and that have an average of time headway that it is almost attested around to a constant value. The stationary periods, as it says the same definition, are characterized by the relatives constant time headway, in other words there aren't meaningful phenomenon of increase or diminution of the traffic flow. The critical periods are static periods that are found on the traffic flow curve defined "critic", this curve we have obtained to envelop some values that mark the lower limit of the diagram defined time length vs. averages of the static periods. Defined the critical periods we have been determined the experimental headway curves and we compared with those theoretical. Of such experimental curves we have been considered the characteristics values: the average and the standard deviation. In this way we have determined a matrix of the average time headway both for operations flight that for type of airplane. The following step has been that to define and to implement the analytical model. We suggest a mathematic algorithm that is able to optimize, a posteriori, the flight operation under the delay restraint. The algorithm determines the best sequence of aircrafts that minimizes the delays and it maximizes the runway capacity. The proposed methodology, even if determine an evident improvement of the runway capacity, in the respect of thresholds of acceptable average delays (constrain), represents an initial methodological phase that will desirably conclude in the determination of a "dynamic" model, that is able to assist the inspectors' job in way real-time, assigning, opportunely, an excellent sequence of the successions of flight operations.

[1]  Dennis F. X. Mathaisel,et al.  Optimizing Gate Assignments at Airport Terminals , 1985, Transp. Sci..

[2]  M. Giraudo,et al.  Probabilità e Statistica per Ingegneria e Scienze , 2007 .

[3]  Ken Fox SMARTEST (SIMULATION MODELLING APPLIED TO ROAD TRANSPORT EUROPEAN SCHEME TESTS) , 1998 .

[4]  Giovanni Andreatta,et al.  Multiairport Ground Holding Problem: A Computational Evaluation of Exact Algorithms , 1998, Oper. Res..

[5]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[6]  ABOLFAZL JALILVAND Using Petri Net and Branch and Bound Algorithm for Modeling and Scheduling of a Flexible Manufacturing System , 2004 .

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[8]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[9]  Stephen F. Smith,et al.  Constructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems , 1986, AI Mag..

[10]  David Abramson,et al.  Computing optimal schedules for landing aircraft , 1993 .

[11]  Roberto Revetria,et al.  International, national and regional sea transportation evolution: a simulation based approach to improve performances of ligurian ports , 2006 .

[12]  Wayne E. Smith Various optimizers for single‐stage production , 1956 .

[13]  N. Dennis,et al.  COMPETITION BETWEEN HUB AIRPORTS IN EUROPE AND A METHODOLOGY FOR FORECASTING CONNECTING TRAFFIC , 1999 .

[14]  Kouji Kurihara,et al.  Optimizing Gate Assignment at Airport Terminal , 2010 .

[15]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[16]  Barbara Pacini,et al.  Introduzione alla statistica , 2001 .

[17]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[18]  François Laburthe,et al.  Disjunctive Scheduling with Task Intervals , 1995 .

[19]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[20]  Yosef S. Sherif,et al.  AN ALGORITHM FOR COMPUTER ASSISTED SEQUENCING AND SCHEDULING OF TERMINAL AREA OPERATIONS , 1991 .

[21]  Ching Chang,et al.  FLIGHT SEQUENCING AND GATE ASSIGNMENTS AT AIRPORT HUBS. , 1994 .

[22]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[23]  L. Guerra,et al.  A heuristic algorithm for the constrained location-routing problem , .

[24]  Stephanie F. Abundo An approach for estimating delays at a busy airport , 1990 .