Abstract

This paper extends previous work on a coupled optimization method for air- port taxiway routing and runway scheduling. An iterative method is used to reduce the computational demand of the required separation constraints whilst introducing no loss in performance. A Receding Horizon (RH) approach is added to further reduce the solution times. As well as faster solve times, RH enables the computation to be spread between horizons preventing detailed plans being calculated for the distant future. RH is an ap- proximation to the globally optimal solution, but still shown to improve upon a First Come First Serve (FCFS) approach, by 56% when comparing the total taxi time and 9% when comparing runway throughput.

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.