A multi-objective evolutionary method for Dynamic Airspace Re-sectorization using sectors clipping and similarities


== Abstract ==

Dynamic Airspace Sectorization (DAS) is a future concept in Air Traffic Management. Its main goal is to increase airspace capacity by reshaping - thus optimizing - airspace sector boundaries based on the specifics of different air traffic situations, weather conditions and other factors. The primary objective for the optimization is to balance and reduce the workload of Air Traffic Controllers (ATCs). Many researchers have made efforts in this topic in the past years. However, air traffic changes continually, and DAS has to be adaptive to each change; be it in terms of aircraft density, dynamic routes, fleet mix, etc. Therefore, instead of sectorizing the airspace each time a change occurs, we should re-sectorize it by maintaining maximum similarities between each sectorization. In this paper, we propose a multi-objective evolutionary computation methodology to re-sectorize an airspace. We use a similarity measure between the existing sectorization and the re-sectorization as an objective to maximize during the evolution.We test the methodology with different air traffic conditions with four objective functions: minimize ATC task load standard deviation, maximize average flight sector time, maximize the minimum distance between traffic crossing points and sector boundaries, and maximize the similarity of two airspace sectorizations. Experimental results show that our re-sectorization method is able to perform airspace re-sectorization under different changes in the air traffic, while satisfying the predefined objectives.


== Original document ==

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

* [https://zenodo.org/record/1266045 https://zenodo.org/record/1266045] under the license https://creativecommons.org/share-your-work/public-domain/cc0/

* [https://zenodo.org/record/1266045/files/article.pdf https://zenodo.org/record/1266045/files/article.pdf]

* [http://xplorestaging.ieee.org/ielx5/6241678/6252855/06253008.pdf?arnumber=6253008 http://xplorestaging.ieee.org/ielx5/6241678/6252855/06253008.pdf?arnumber=6253008],
: [http://dx.doi.org/10.1109/cec.2012.6253008 http://dx.doi.org/10.1109/cec.2012.6253008] under the license cc0

* [https://dblp.uni-trier.de/db/conf/cec/cec2012.html#TangALA12 https://dblp.uni-trier.de/db/conf/cec/cec2012.html#TangALA12],
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006253008 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006253008],
: [https://ieeexplore.ieee.org/document/6253008 https://ieeexplore.ieee.org/document/6253008],
: [https://dx.doi.org/10.1109/CEC.2012.6253008 https://dx.doi.org/10.1109/CEC.2012.6253008],
: [http://ieeexplore.ieee.org/document/6253008 http://ieeexplore.ieee.org/document/6253008],
: [http://dx.doi.org/10.1109/CEC.2012.6253008 http://dx.doi.org/10.1109/CEC.2012.6253008],
: [https://academic.microsoft.com/#/detail/2048521235 https://academic.microsoft.com/#/detail/2048521235]