A New Multiobjective <i>A</i><sup>∗</sup> Algorithm With Time Window Applied to Large Airports
Bibliographic record
Abstract
Current airport ground operations, relying on single and fixed aircraft taxiing rules, struggle to handle dynamic traffic flow changes during peak flight times at large airports. This leads to inefficient taxiing routes, prolonged taxiing times, and high fuel consumption. This paper addresses these issues by proposing a new adaptive method for dynamic taxiway routing in airport ground operations. This method aims to reduce ground taxiing time and fuel consumption while ensuring the safety of aircraft taxiing. This 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, differing 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. The results of the study indicate that the proposed multiobjective A ∗ algorithm with time windows can effectively provide decision support for dynamic routing in airport ground operations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".