Home > Research > Publications & Outputs > Incorporating slot valuation in making airport ...

Links

Text available via DOI:

View graph of relations

Incorporating slot valuation in making airport slot scheduling decisions

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Incorporating slot valuation in making airport slot scheduling decisions. / Katsigiannis, Fotios A.; Zografos, K. G.
In: European Journal of Operational Research, Vol. 308, No. 1, 01.07.2023, p. 436-454.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Katsigiannis FA, Zografos KG. Incorporating slot valuation in making airport slot scheduling decisions. European Journal of Operational Research. 2023 Jul 1;308(1):436-454. Epub 2023 Feb 16. doi: 10.1016/j.ejor.2022.11.008

Author

Katsigiannis, Fotios A. ; Zografos, K. G. / Incorporating slot valuation in making airport slot scheduling decisions. In: European Journal of Operational Research. 2023 ; Vol. 308, No. 1. pp. 436-454.

Bibtex

@article{e36b7a72a0bf47b5b3aae77ed1f500c7,
title = "Incorporating slot valuation in making airport slot scheduling decisions",
abstract = "Airport Slot Allocation (ASA) seeks to manage scarce airport resources by matching airline requests to airport slots. The ASA process is carried out by coordinators, who prioritise airline requests through the consideration of policy rules that aim to serve airlines and the travelling public, improve airport capacity utilisation, connectivity, and competition. Even though the ASA involves both airlines and coordinators, existing studies model the ASA without considering the interactions between airlines{\textquoteright} preferences and the rules and priorities that are considered by the coordinators. This paper introduces an ASA problem variant in which the assignment of airport slots is modelled by considering the interrelation between airlines{\textquoteright} preferences and coordinators{\textquoteright} prioritisation, expressed through time-dependent valuation functions. Through the development of a Mixed Integer Programming Model (MIP) and a preference-based algorithm that integrate the developed valuation functions, we propose request-to-slot assignments that are Pareto optimal per se, ergo guaranteeing that airlines and coordinators have no incentive to reject or alter the proposed schedules. Computational results demonstrate the ability of the proposed MIP and algorithm in supporting coordinators on decisions relating to which requests will be displaced or rejected so as to achieve improved capacity utilisation.",
keywords = "Transportation, Airport slot allocation, Mixed integer programming, Pareto efficiency, Demand management",
author = "Katsigiannis, {Fotios A.} and Zografos, {K. G.}",
year = "2023",
month = jul,
day = "1",
doi = "10.1016/j.ejor.2022.11.008",
language = "English",
volume = "308",
pages = "436--454",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "1",

}

RIS

TY - JOUR

T1 - Incorporating slot valuation in making airport slot scheduling decisions

AU - Katsigiannis, Fotios A.

AU - Zografos, K. G.

PY - 2023/7/1

Y1 - 2023/7/1

N2 - Airport Slot Allocation (ASA) seeks to manage scarce airport resources by matching airline requests to airport slots. The ASA process is carried out by coordinators, who prioritise airline requests through the consideration of policy rules that aim to serve airlines and the travelling public, improve airport capacity utilisation, connectivity, and competition. Even though the ASA involves both airlines and coordinators, existing studies model the ASA without considering the interactions between airlines’ preferences and the rules and priorities that are considered by the coordinators. This paper introduces an ASA problem variant in which the assignment of airport slots is modelled by considering the interrelation between airlines’ preferences and coordinators’ prioritisation, expressed through time-dependent valuation functions. Through the development of a Mixed Integer Programming Model (MIP) and a preference-based algorithm that integrate the developed valuation functions, we propose request-to-slot assignments that are Pareto optimal per se, ergo guaranteeing that airlines and coordinators have no incentive to reject or alter the proposed schedules. Computational results demonstrate the ability of the proposed MIP and algorithm in supporting coordinators on decisions relating to which requests will be displaced or rejected so as to achieve improved capacity utilisation.

AB - Airport Slot Allocation (ASA) seeks to manage scarce airport resources by matching airline requests to airport slots. The ASA process is carried out by coordinators, who prioritise airline requests through the consideration of policy rules that aim to serve airlines and the travelling public, improve airport capacity utilisation, connectivity, and competition. Even though the ASA involves both airlines and coordinators, existing studies model the ASA without considering the interactions between airlines’ preferences and the rules and priorities that are considered by the coordinators. This paper introduces an ASA problem variant in which the assignment of airport slots is modelled by considering the interrelation between airlines’ preferences and coordinators’ prioritisation, expressed through time-dependent valuation functions. Through the development of a Mixed Integer Programming Model (MIP) and a preference-based algorithm that integrate the developed valuation functions, we propose request-to-slot assignments that are Pareto optimal per se, ergo guaranteeing that airlines and coordinators have no incentive to reject or alter the proposed schedules. Computational results demonstrate the ability of the proposed MIP and algorithm in supporting coordinators on decisions relating to which requests will be displaced or rejected so as to achieve improved capacity utilisation.

KW - Transportation

KW - Airport slot allocation

KW - Mixed integer programming

KW - Pareto efficiency

KW - Demand management

U2 - 10.1016/j.ejor.2022.11.008

DO - 10.1016/j.ejor.2022.11.008

M3 - Journal article

VL - 308

SP - 436

EP - 454

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -