Latest revision as of 16:18, 12 February 2021

Abstract

This paper deals with dynamic airspace sectorization (DAS) problem by an improved genetic algorithm (iGA). A graph model is first constructed that represents the airspace static structure. Then the DAS problem is formulated as a graph-partitioning problem to balance the sector workload under the premise of ensuring safety. In the iGA, multiple populations and hybrid coding are applied to determine the optimal sector number and airspace sectorization. The sector constraints are well satisfied by the improved genetic operators and protect zones. This method is validated by being applied to the airspace of North China in terms of three indexes, which are sector balancing index, coordination workload index and sector average flight time index. The improvement is obvious, as the sector balancing index is reduced by 16.5 %, the coordination workload index is reduced by 11.2 %, and the sector average flight time index is increased by 11.4 % during the peak-hour traffic.

Document type: Article

Full document

Original document

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

• http://dx.doi.org/10.1007/s40534-013-0010-2 under the license https://creativecommons.org/licenses/by

• https://link.springer.com/content/pdf/10.1007%2Fs40534-013-0010-2.pdf under the license http://www.springer.com/tdm

• http://link.springer.com/article/10.1007/s40534-013-0010-2/fulltext.html,

http://link.springer.com/content/pdf/10.1007/s40534-013-0010-2.pdf,

http://link.springer.com/content/pdf/10.1007/s40534-013-0010-2,

http://dx.doi.org/10.1007/s40534-013-0010-2 under the license cc-by

• https://link.springer.com/article/10.1007/s40534-013-0010-2,

https://trid.trb.org/view/1261375,

https://core.ac.uk/display/81780357,

https://paperity.org/p/33266749/dynamic-airspace-sectorization-via-improved-genetic-algorithm,

https://academic.microsoft.com/#/detail/1966633870 under the license http://creativecommons.org/licenses/by/2.0