A Method for Rapid Prototyping and Benchmarking of Arrival Sequencing and Scheduling Algorithms

Abstract

method is introduced for rapid prototyping and benchmarking of arrival sequencing and scheduling algorithms for air traffic management . The method has three main components: 1) algorithm models 2) rec orded air traffic simulation data, and 3) a free software library that interface s the algorithm models with the simulation output database. By accessing simulation data via a relational database, t he method makes it possible to quickly implement prototype algorithms and then to evaluate them without a direct interface to the airspace simulator code . To illustrate this method , a basic first -come, first serve d arrival sequencing and scheduling algorithm was studied . Results are offered as benchmarks for com pari son with future arrival sequencing and scheduling algorithms.

Original document

The different versions of the original document can be found in:

• http://pdfs.semanticscholar.org/935e/aad864ce5fdc6d7f0697320436a150a0fa0e.pdf

• http://arc.aiaa.org/doi/pdf/10.2514/6.2007-7834,

http://dx.doi.org/10.2514/6.2007-7834

• https://www.aviationsystemsdivision.arc.nasa.gov/publications/modeling/Thipphavong_AIAA_ATIO_2007_1.pdf,

https://arc.aiaa.org/doi/10.2514/6.2007-7834,

https://www.aviationsystems.arc.nasa.gov/publications/modeling/Thipphavong_AIAA_ATIO_2007_1.pdf,

http://www.aviationsystemsdivision.arc.nasa.gov/publications/modeling/Thipphavong_AIAA_ATIO_2007_1.pdf,

https://academic.microsoft.com/#/detail/2064469762