Abstract

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 São 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.

Highlights

  • In airport operations, the handling of aircraft movements requires the decision to assign aircraft to specific stands

  • The results suggest that the trade-off between walking distance (WD) and potential commercial revenue (PCR) is rather small—Guarulhos International Airport of São Paulo (GRU) airport can increase the average potential commercial revenue over the scenarios (AVG PCR) by up to 3.3% if it accepts an increase in the average walking distance over the scenarios (AVG WD) of passengers with up to 10%

  • We presented a recoverable robust stand allocation model to address the tactical airport stand allocation problem (TSAP)

Read more

Summary

Introduction

The handling of aircraft movements requires the decision to assign aircraft to specific stands. The allocation of aircraft to the stands is usually done 1 day before operations, providing airport gate controllers and airlines with a plan for the coming day. This paper addresses the TSAP adopting the recoverable robustness concept to design flexible allocation plans. This is a rather new concept, introduced by Liebchen et al (2009), that to our knowledge was never applied to the stand allocation problem. This is the first application of the recoverable robustness concept to the TSAP We believe this is a relevant approach for the TSAP because it provides a less conservative concept to the robust stand allocation problem, accommodating multiple scenarios of flight times without compromising overall efficiency of the solutions.

The tactical stand allocation problem
Input data
TSAP mathematical formulation
Objective function
Passenger-oriented objectives
Airport-oriented objectives
Recoverable robust stand allocation model
Step S: scenario generation
Step R
Result
Solving the RRTSAP
Resulting RRTSAP model
GRU case study
Recoverable robustness versus strict robustness
Objective function comparison
Objective
Findings
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.