The recoverable robust stand allocation problem: a GRU airport case study

被引:31
|
作者
Dijk, Bert [1 ]
Santos, Bruno F. [1 ]
Pita, Joao P. [2 ]
机构
[1] Delft Univ Technol, Air Transport & Operat, Fac Aerosp Engn, Kluyverweg 1, NL-2629 HS Delft, Netherlands
[2] GRU Airport, Rod Helio Smidt S-N, Guarulhos, Brazil
关键词
Airport; Stand allocation; Recoverable robustness; Commercial revenue; GATE ASSIGNMENT PROBLEM; AIRCRAFT; OPTIMIZATION; TIME;
D O I
10.1007/s00291-018-0525-3
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an innovative approach to the tactical planning of aircraft remote and contact-stands allocation at airports. We use the concept of recoverable robustness to obtain a recoverable robust solution to the stand allocation problem, a solution that can be recovered by limited means for the included scenarios. Four objective functions are discussed and tested to assess the efficiency of a stand allocation plan. Namely, the minimization of passengers' walking distance, the minimization of tows, the maximization of the number of passengers allocated to contact-stands, and the maximization of the potential airport commercial revenue. The inclusion of an airport commercial revenue metric in the stand allocation optimization model and the comparison of its performance to the pre-mentioned other objectives is another novelty of this work. The research was developed in collaboration with the Guarulhos International Airport of Sao Paulo for which the recoverable robust approach was tested for 6 days of operations at the airport. We demonstrate that the solutions obtained with the proposed approach outperform the solutions of a traditional robust approach. In addition, a discussion of the trade-off between the different objectives is provided.
引用
收藏
页码:615 / 639
页数:25
相关论文
共 50 条
  • [1] The recoverable robust stand allocation problem: a GRU airport case study
    Bert Dijk
    Bruno F. Santos
    Joao P. Pita
    OR Spectrum, 2019, 41 : 615 - 639
  • [2] Exact and heuristic approaches to the airport stand allocation problem
    Guepet, J.
    Acuna-Agost, R.
    Briant, O.
    Gayon, J. P.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (02) : 597 - 608
  • [3] On the recoverable robust traveling salesman problem
    Chassein, Andre
    Goerigk, Marc
    OPTIMIZATION LETTERS, 2016, 10 (07) : 1479 - 1492
  • [4] On the recoverable robust traveling salesman problem
    André Chassein
    Marc Goerigk
    Optimization Letters, 2016, 10 : 1479 - 1492
  • [5] The recoverable robust facility location problem
    Alvarez-Miranda, Eduardo
    Fernandez, Elena
    Ljubic, Ivana
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 79 : 93 - 120
  • [6] The Recoverable Robust Tail Assignment Problem
    Froyland, Gary
    Maher, Stephen J.
    Wu, Cheng-Lung
    TRANSPORTATION SCIENCE, 2014, 48 (03) : 351 - 372
  • [7] Study on coloring method of airport flight-gate allocation problem
    Hongyan Li
    Xianfeng Ding
    Jiang Lin
    Jingyu Zhou
    Journal of Mathematics in Industry, 9
  • [8] Formulations and algorithms for the recoverable -robust knapsack problem
    Buesing, Christina
    Goderbauer, Sebastian
    Koster, Arie M. C. A.
    Kutschka, Manuel
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (01) : 15 - 45
  • [9] Study on coloring method of airport flight-gate allocation problem
    Li, Hongyan
    Ding, Xianfeng
    Lin, Jiang
    Zhou, Jingyu
    JOURNAL OF MATHEMATICS IN INDUSTRY, 2019, 9 (01)
  • [10] Two-stage recoverable robust optimization for an integrated location-allocation and evacuation planning problem
    Yin, Yunqiang
    Xu, Xinrui
    Wang, Dujuan
    Yu, Yugang
    Cheng, T. C. E.
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2024, 182