| タイトル | Runway Operations Planning: A Two-Stage Heuristic Algorithm |
| 本文（外部サイト） | http://hdl.handle.net/2060/20030068010 |
| 著者（英） | Clarke, John-Paul; Anagnostakis, Ioannis |
| 著者所属（英） | Massachusetts Inst. of Tech. |
| 発行日 | 2003-01-01 |
| 言語 | eng |
| 内容記述 | The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented. |
| NASA分類 | Air Transportation and Safety |
| 権利 | Copyright, Distribution under U.S. Government purpose rights |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/89864 |
