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 条
  • [41] Investigating the recoverable robust single machine scheduling problem under interval uncertainty
    Bold, Matthew
    Goerigk, Marc
    Discrete Applied Mathematics, 2022, 313 : 99 - 114
  • [42] Investigating the recoverable robust single machine scheduling problem under interval uncertainty
    Bold, Matthew
    Goerigk, Marc
    DISCRETE APPLIED MATHEMATICS, 2022, 313 : 99 - 114
  • [43] Optimizing airport service performance by spatial multi objective location allocation problem
    Abouzar Ramezani
    Mohammad Reza Malek
    Nazila Mohammadi
    Spatial Information Research, 2021, 29 : 309 - 318
  • [44] Research on Airport Gate Allocation Problem Based on NSGA-II Algorithm
    Shi, Zhan
    Zong, Teng
    PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND NETWORKS, VOL II, CENET 2023, 2024, 1126 : 8 - 18
  • [45] Optimizing airport service performance by spatial multi objective location allocation problem
    Ramezani, Abouzar
    Malek, Mohammad Reza
    Mohammadi, Nazila
    SPATIAL INFORMATION RESEARCH, 2021, 29 (03) : 309 - 318
  • [46] Research on problem of the airport refueling vehicle Allocation (ID:F-055)
    Lu Chaorong
    Li Daoqiang
    Huang Yongping
    PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS A AND B: BUILDING CORE COMPETENCIES THROUGH IE&EM, 2007, : 700 - 704
  • [47] A Robust Model for the Bases Location and Ambulances Allocation Problem
    Ribeiro Marques, Raina
    Alves de Queiroz, Thiago
    Antonio Borges, Romes
    IEEE LATIN AMERICA TRANSACTIONS, 2019, 17 (11) : 1887 - 1893
  • [48] Formulating robust regression estimation as an optimum allocation problem
    Camarinopoulos, L
    Zioutas, G
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2002, 72 (09) : 687 - 705
  • [49] A ROBUST POSSIBILISTIC PROGRAMMING MODEL FOR WATER ALLOCATION PROBLEM
    Fazli-Khalaf, Mohamadreza
    Fathollahzadeh, Karo
    Mollaei, Amir
    Naderi, Bahman
    Mohammadi, Mohammad
    RAIRO-OPERATIONS RESEARCH, 2019, 53 (01) : 323 - 338
  • [50] Questioning airport expansion - A case study of Canberra International Airport
    May, Murray
    Hill, Stuart B.
    JOURNAL OF TRANSPORT GEOGRAPHY, 2006, 14 (06) : 437 - 450