Abstract

Air traffic management measures comprise tactical operating procedures to minimize delay costs and strategic scheduling interventions to control overcapacity scheduling. Although interdependent, these problems have been treated in isolation. This paper proposes an integrated model of scheduling and operations in airport networks that jointly optimizes scheduling interventions and ground-holding operations across airports networks under operating uncertainty. It is formulated as a two-stage stochastic program with integer recourse. To solve it, we develop an original decomposition algorithm with provable solution quality guarantees. The algorithm relies on new optimality cuts—dual integer cuts—that leverage the reduced costs of the dual linear programming relaxation of the second-stage problem. The algorithm also incorporates neighborhood constraints, which shift from exploration to exploitation at later stages. We also use a scenario generation approach to construct representative scenarios from historical records of operations—using integer programming. Computational experiments show that our algorithm yields near-optimal solutions for the entire U.S. National Airspace System network. Ultimately, the proposed approach enhances airport demand management models through scale integration (by capturing network-wide interdependencies) and scope integration (by capturing interdependencies between scheduling and operations).

Full Text
Paper version not known

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 call

Disclaimer: 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.