A New Multiobjective A∗ Algorithm With Time Window Applied to Large Airports
Résumé
Current airport ground operations, relying on single and fxed aircraft taxiing rules, struggle to handle dynamic trafc fow changes during peak fight times at large airports. Tis leads to inefcient taxiing routes, prolonged taxiing times, and high fuel consumption. Tis paper addresses these issues by proposing a new adaptive method for dynamic taxiway routing in airport ground operations. Tis method aims to reduce ground taxiing time and fuel consumption while ensuring the safety of aircraft taxiing. Tis study proposes a multiobjective A * algorithm with time windows which takes into account the allocation of resources on airport taxiways and introduces factors such as turning angles, dynamic turning speeds, and dynamic characteristics of the ground operations. Experiments conducted over the 10 busiest days in the history of Tianjin Binhai International Airport demonstrate that the algorithm excels in minimizing total taxiing time, difering only by 0.5% from the optimal solution. It also optimizes multiple objectives such as fuel consumption and operates at a solving speed approximately three orders of magnitude faster than the optimal solution algorithm, enabling real-time calculation of aircraft taxiing paths. Te results of the study indicate that the proposed multiobjective A * algorithm with time windows can efectively provide decision support for dynamic routing in airport ground operations.
Origine | Fichiers produits par l'(les) auteur(s) |
---|---|
Licence |