Abstract
The Ground Routing Problem focuses on finding the optimal routing of aircraft from parking stands to runways. The Runway Sequencing Problem consists in ordering the sequence of takes-offs and landings on runways. We study the integration of these two problems with the aim of simultaneously increasing runway efficiency and reducing taxi times. We propose a heuristic sequential approach based on a novel mathematical formulation. We test our methods using real data of a major European airport. Our approach significantly reduces the total completion and taxi times within reasonable computation times, making it viable to be used in daily operations.
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.
