Dynamic scheduling of aircraft landings
| Autor: | Mohammad Mesgarpour, Chris N. Potts, Julia A. Bennell |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
050210 logistics & transportation
Schedule 021103 operations research Information Systems and Management General Computer Science Computer science 05 social sciences Real-time computing Separation (aeronautics) 0211 other engineering and technologies ComputerApplications_COMPUTERSINOTHERSYSTEMS 02 engineering and technology Dynamic priority scheduling Management Science and Operations Research Industrial and Manufacturing Engineering Scheduling (computing) Modeling and Simulation 0502 economics and business Runway Throughput (business) |
| ISSN: | 0377-2217 |
| Popis: | This paper considers the scheduling of aircraft landings on a single runway. There are time window constraints for each aircraft's landing time, and minimum separation times between consecutive landings, where the separation times depend on the weight classes of the two landing aircraft. A multi-objective formulation takes account of runway through-put, earliness and lateness, and the cost of fuel arising from aircraft manoeuvres and additional flight time incurred to achieve the landing schedule. The paper investigates both the static/o -line problem where details of the arriving flights are known in advance, and the dynamic/on-line problem where flight arrival information becomes available over time. Under dynamic scheduling, the algorithm makes periodic updates to the previous schedule to take into account the aircraft that are newly available. We investigate dynamic programming and local search implementations for the static and dynamic problem using random test data and real data from London Heathrow airport. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect