原文传递
A traveling-salesman-based approach to aircraft scheduling in the terminal area
| 题名： | A traveling-salesman-based approach to aircraft scheduling in the terminal area |
| 作者： | Luenberger, Robert A. |
| 关键词： | scheduling；terminal；travel；ales；algorithm；craft；proa；base；elin；percent |
| 摘要： | An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial position in the landing order. This limitation is needed so that no aircraft or aircraft category is unduly penalized. Results indicate, for the mix of arrivals investigated, a potential increase in capacity in the 3 to 5 percent range. Furthermore, it is shown that the computation time for the algorithm grows only linearly with problem size. |
| 报告类型： | 科技报告 |
相关文献
- Design and Evaluation of the Terminal Area Precision Scheduling and Spacing System.
- Search problems in mission planning and navigation of autonomous aircraft
- Simulation evaluation of TIMER, a time-based, terminal air traffic, flow-management concept
- Time-based air traffic management using expert systems
- Highly Automated Arrival Management and Control System Suitable for Early NextGen.
- Time-based self-spacing techniques using cockpit display of traffic information during approach to landing in a terminal area vectoring environment
检索历史
应用推荐
