Pruning Rules for Optimal Runway Sequencing
- Submitting institution
-
The University of Leicester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1431
- Type
- D - Journal article
- DOI
-
10.1287/trsc.2016.0733
- Title of journal
- Transportation Science
- Article number
- -
- First page
- 898
- Volume
- 52
- Issue
- 4
- ISSN
- 0041-1655
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
https://doi.org/10.1287/trsc.2016.0733
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduced a fast runway sequencing algorithm which is able to find optimal solutions to large-scale instances. This work was funded by EPSRC and is based on close cooperation with National Air Traffic Services (www.nats.aero), the UK's leading provider of air traffic control services. The paper provides the theoretical underpinning of the methodology. Some elements of this work are related to the author’s software, which is currently in use at London Heathrow, Europe’s busiest hub airport, to sequence departures (http://www.nottingham.ac.uk/aerospace/news/iat-news/iat-academic-discusses-airport-scheduling-at-heathrow-on-bbc-series.aspx).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -