Abstract
The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.
Highlights
Tremendous growth in air traffic demand has been made due to the rapid development of economics worldwide
The tremendous growth breaks the balance between the demand and supply capacity, and leads to airspace congestion and flight delay, which challenge the conventional Air Traffic Management (ATM) approaches [2]
The successive constraints are associated with two consecutive aircrafts at the runway, while the complete ones are made for the two non-consecutive aircrafts assigned to either the same departure fix or identical destination (e.g., Minutes-In-Trail separation)
Summary
Tremendous growth in air traffic demand has been made due to the rapid development of economics worldwide. A bi-objective integer programming model for partly-restricted flight departure scheduling consecutive operations at the runway limits the former), constraints, and objective functions [3] Studies regarding these two problems are fruitful, especially the former (e.g., [4,5,6,7,8,9,10,11,12,13,14,15]). The successive constraints are associated with two consecutive aircrafts at the runway (e.g., wake vortex separation standards), while the complete ones are made for the two non-consecutive aircrafts assigned to either the same departure fix or identical destination (e.g., Minutes-In-Trail separation) Besides to those normal separations, the addition of restricted time periods inflict new changes on the separations. The objectives of the current problem are stated as follows
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
