Using Continuous Hopfield Network for Static sectorization of Airspace

摘要

As traffic keeps increasing, en route capacity, especially in Europe, becomes a serious problem. According to the European Commission, every year, the number of flights in operation increases by 5%, which is the principal cause of airspace saturation and raise of the controller's workload. Today, the Sectorization of Airspace Problem (SAP) has become one of the most important problems of operational research. The main objective of the SAP is to minimize the total coordination workload between adjacent sectors and to balance the controllers' workload among sectors. To solve this problem, we model the SAP in terms of 0-1 quadratic programming subject to linear constraints. As result, we use the Continuous Hopfield Network CHN to solve the proposed model; in addition, some numerical results are introduced to confirm the most optimal model.