Hamdan, Sadeque, Jouini, Oualid, Cheaitou, Ali, Jemai, Zied, Granberg, Tobias Andersson (2023) On the Binary Formulation of Air Traffic Flow Management Problems. Annals of Operations Research, 321 (1-2). pp. 267-279. ISSN 0254-5330. E-ISSN 1572-9338. (doi:10.1007/s10479-022-04740-1) (KAR id:94912)
PDF
Publisher pdf
Language: English
This work is licensed under a Creative Commons Attribution 4.0 International License.
|
|
Download this file (PDF/1MB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/615kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: https://doi.org/10.1007/s10479-022-04740-1 |
Abstract
We discuss a widely used air traffic flow management formulation. We show that this formulation can lead to a solution where air delays are assigned to flights during their take-off which is prohibited in practice. Although air delay is more expensive than ground delay, the model may assign air delay to a few flights during their take-off to save more on not having as much ground delay. We present a modified formulation and verify its functionality in avoiding incorrect solutions.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1007/s10479-022-04740-1 |
Uncontrolled keywords: | Transportation, Air traffic flow management (ATFM), departure capacity constraint, ground delay, network optimization |
Subjects: | H Social Sciences |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Funders: | University of Kent (https://ror.org/00xkeyj56) |
Depositing User: | Sadeque Hamdan |
Date Deposited: | 06 May 2022 11:40 UTC |
Last Modified: | 05 Nov 2024 12:59 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/94912 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):