Abstract
The ever-growing air traffic demand arouses an urgent need for improved airport ground movement efficiency. New operational concepts are emerging which use time-based taxi trajectories to reduce uncertainty and make more efficient use of the airport resource. In this study, an improved approach is proposed for time-based taxi trajectory planning, which is formulated as the shortest path problem with time windows and the maximum traversal time constraint. With the introduction of the taxi time in the cost and the maximum traversal time constraint to limit the waiting time, more efficient and fluent ground movement of aircraft can be realised. An A*-based solution algorithm is developed for the investigated problem, which utilises the arrival time interval and dominance-based comparison to search for the best solution. Experimental results on real-world problem instances demonstrate the effectiveness of the proposed approach as well as its advantages over the existing approach.
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.
