Airport Terminal Airspace Arrival & Departure Fixes Capacity Optimization using Branch and Bound Algorrithm

The demand of flights are continuously increasing over the world, maximizing airport capacities becomes crucial to efficient air traffic management. The proper planning for the terminal airspace to avoid congestion or distribute the traffic among all terminal fixes (arrival/departure gates) is important to achieve the overall terminal space capacity. Therefore, the objective in this paper to address the characteristic of the airport terminal airspace fixes demand and how to achieve proper distribution that meets the overall capacity. In section 2, the author introduces the Terminal Airspace areas fixes demand distribution problem. In section 3, a mathematical model how to properly optimize the fixes capacity according to the runway capacity limitation is proposed. In section 4 it is presented the implementation experiment using Branch and Bound algorithm to get optimal allocation of demand for both arrival and departure fixes.