A Comparison of Algorithm Generated Sectorizations

Abstract

This paper discusses a comparison of several algo- rithm generated airspace boundary designs, known as sectoriza- tions. Three algorithms are chosen that approach the airspace sectorization problem in different ways and produce radically dif- ferent looking sectorizations due to the disparity in their methods. Simulations of air traffic using each of the sectorizations is com- pleted and their resulting demand, capacity, complexity, and delay metrics are compared. Results identify strengths and weaknesses of each sectorization algorithm.