Home > Research > Publications & Outputs > Models and Algorithms for the Airport Capacity ...

Research

Links

Text available via DOI:

View graph of relations

Models and Algorithms for the Airport Capacity Allocation Problem

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

Published

Standard

Models and Algorithms for the Airport Capacity Allocation Problem. / Dell'Olmo, Paolo; Lulli, Guglielmo.
Operations Research in Space and Air. ed. / Tito A. Ciriani; Giorgio Fasano; Stefano Gliozzi; Roberto Tadei. Springer, 2003. p. 351-368.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

Harvard

Dell'Olmo, P & Lulli, G 2003, Models and Algorithms for the Airport Capacity Allocation Problem. in TA Ciriani, G Fasano, S Gliozzi & R Tadei (eds), Operations Research in Space and Air. Springer, pp. 351-368. https://doi.org/10.1007/978-1-4757-3752-3_18

APA

Dell'Olmo, P., & Lulli, G. (2003). Models and Algorithms for the Airport Capacity Allocation Problem. In T. A. Ciriani, G. Fasano, S. Gliozzi, & R. Tadei (Eds.), Operations Research in Space and Air (pp. 351-368). Springer. https://doi.org/10.1007/978-1-4757-3752-3_18

Vancouver

Dell'Olmo P, Lulli G. Models and Algorithms for the Airport Capacity Allocation Problem. In Ciriani TA, Fasano G, Gliozzi S, Tadei R, editors, Operations Research in Space and Air. Springer. 2003. p. 351-368 doi: 10.1007/978-1-4757-3752-3_18

Author

Dell'Olmo, Paolo ; Lulli, Guglielmo. / Models and Algorithms for the Airport Capacity Allocation Problem. Operations Research in Space and Air. editor / Tito A. Ciriani ; Giorgio Fasano ; Stefano Gliozzi ; Roberto Tadei. Springer, 2003. pp. 351-368

Bibtex

@inbook{fc07ea78828f47918aa23abef6f8e835,
title = "Models and Algorithms for the Airport Capacity Allocation Problem",
abstract = "In this chapter, we present the airport capacity allocation problem, i.e., the problem of finding for each time unit the optimal balance between the number of arrivals and departures in order to reduce the total economic loss over a given decision horizon. In this class of problem, airport capacity is represented by an arrival-departure capacity curve or envelope. Therefore, arrival and departure capacities are considered as interdependent variables whose values depend on the arrival/departure ratio of total airport operations.We formalise both the single-airport and the multi-airport version of the problem. In particular, for the single-airport capacity allocation problem, we present a dynamic programming formulation solved by using a customised algorithm. For the multi-airport version we propose a integer programming formulation, since some of the properties of the single-airport capacity allocation problem break down when dealing with a network structure. We solve this version of the problem using the CPLEX branch and bound. Computational results are given for both versions of the problem.",
author = "Paolo Dell'Olmo and Guglielmo Lulli",
year = "2003",
doi = "10.1007/978-1-4757-3752-3_18",
language = "English",
isbn = "9781441952424",
pages = "351--368",
editor = "Ciriani, {Tito A. } and Giorgio Fasano and Stefano Gliozzi and Roberto Tadei",
booktitle = "Operations Research in Space and Air",
publisher = "Springer",

}

RIS

TY - CHAP

T1 - Models and Algorithms for the Airport Capacity Allocation Problem

AU - Dell'Olmo, Paolo

AU - Lulli, Guglielmo

PY - 2003

Y1 - 2003

N2 - In this chapter, we present the airport capacity allocation problem, i.e., the problem of finding for each time unit the optimal balance between the number of arrivals and departures in order to reduce the total economic loss over a given decision horizon. In this class of problem, airport capacity is represented by an arrival-departure capacity curve or envelope. Therefore, arrival and departure capacities are considered as interdependent variables whose values depend on the arrival/departure ratio of total airport operations.We formalise both the single-airport and the multi-airport version of the problem. In particular, for the single-airport capacity allocation problem, we present a dynamic programming formulation solved by using a customised algorithm. For the multi-airport version we propose a integer programming formulation, since some of the properties of the single-airport capacity allocation problem break down when dealing with a network structure. We solve this version of the problem using the CPLEX branch and bound. Computational results are given for both versions of the problem.

AB - In this chapter, we present the airport capacity allocation problem, i.e., the problem of finding for each time unit the optimal balance between the number of arrivals and departures in order to reduce the total economic loss over a given decision horizon. In this class of problem, airport capacity is represented by an arrival-departure capacity curve or envelope. Therefore, arrival and departure capacities are considered as interdependent variables whose values depend on the arrival/departure ratio of total airport operations.We formalise both the single-airport and the multi-airport version of the problem. In particular, for the single-airport capacity allocation problem, we present a dynamic programming formulation solved by using a customised algorithm. For the multi-airport version we propose a integer programming formulation, since some of the properties of the single-airport capacity allocation problem break down when dealing with a network structure. We solve this version of the problem using the CPLEX branch and bound. Computational results are given for both versions of the problem.

U2 - 10.1007/978-1-4757-3752-3_18

DO - 10.1007/978-1-4757-3752-3_18

M3 - Chapter (peer-reviewed)

SN - 9781441952424

SP - 351

EP - 368

BT - Operations Research in Space and Air

A2 - Ciriani, Tito A.

A2 - Fasano, Giorgio

A2 - Gliozzi, Stefano

A2 - Tadei, Roberto

PB - Springer

ER -