The University of Southampton
University of Southampton Institutional Repository

Dynamic scheduling of aircraft landings

Dynamic scheduling of aircraft landings
Dynamic scheduling of aircraft landings
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.
runway scheduling, dynamic programming, local search, online problem
0377-2217
315-327
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Mesgarpour, Mohammad
93477bd1-cb4b-4428-943c-e11b2c08540c
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Mesgarpour, Mohammad
93477bd1-cb4b-4428-943c-e11b2c08540c
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff

Bennell, Julia A., Mesgarpour, Mohammad and Potts, Chris N. (2016) Dynamic scheduling of aircraft landings. European Journal of Operational Research, 258 (1), 315-327. (doi:10.1016/j.ejor.2016.08.015).

Record type: Article

Abstract

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.

Text
__soton.ac.uk_ude_PersonalFiles_Users_sb1u11_mydocuments_Academic Papers EPrints & REF_SBS Papers in ePrints_AirportRunwayLanding_EJOR_accepted.pdf - Accepted Manuscript
Download (360kB)

More information

Accepted/In Press date: 4 August 2016
e-pub ahead of print date: 10 August 2016
Keywords: runway scheduling, dynamic programming, local search, online problem
Organisations: Southampton Business School

Identifiers

Local EPrints ID: 399233
URI: http://eprints.soton.ac.uk/id/eprint/399233
ISSN: 0377-2217
PURE UUID: e4650720-0cc8-4bd5-9717-09cd448009b1

Catalogue record

Date deposited: 09 Aug 2016 10:40
Last modified: 17 Dec 2019 06:42

Export record

Altmetrics

Contributors

Author: Julia A. Bennell
Author: Mohammad Mesgarpour
Author: Chris N. Potts

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×