Rolling Horizon Approach for Solving Gate Assignment Problem

Closed

Anggita Ketlin Bella Pratiwi, Jamaliatul Badriyah, Mochammad Hafiizh, Lilik Muzdalifah

2025 AIP Conference Proceedings Vol. 3446 Issue 1 Conference paper Cited by 0 Quartile

Abstract

The Gate Assignment Problem (GAP) is a complex optimization issue frequently encountered in airport management, involving the assignment of aircraft to available gates while minimizing operational costs and meeting various constraints. Given the large scale of the problem, it is challenging to solve using traditional methods. This study proposes the use of a Rolling Horizon Approach (RHA) to address the GAP, allowing for dynamic decision-making over time and providing a flexible framework to manage uncertainty and fluctuations in flight schedules. The Rolling Horizon Approach breaks the problem into manageable sub-problems, optimizing gate assignments within a fixed planning horizon and updating the decisions periodically. This methodology is applied to a case study at Sultan Aji Muhammad Sulaiman Sepinggan International Airport in Balikpapan, Indonesia. The results demonstrate that the RHA can significantly improve gate utilization efficiency and reduce operational disruptions by adapting to real-time conditions. The study highlights the potential of RHA as an effective tool for large-scale, dynamic airport operations. © 2025 American Institute of Physics Inc.. All rights reserved.

Affiliations

Mathematics Department, Universitas Negeri Malang, Malang, Indonesia; Mathematics Department, Universitas Jenderal Soedirman, Banyumas, Indonesia