Gate Assignment Based on Deep Reinforcement Learning

Zheng XIANG , Qiu-yue WU , Tong CHU , Yi-yang YUE

Science Technology and Engineering ›› 2025, Vol. 25 ›› Issue (16) : 6977 -6984.

PDF
Science Technology and Engineering ›› 2025, Vol. 25 ›› Issue (16) : 6977-6984 DOI: 10.12404/j.issn.1671-1815.2405560
research-article
Gate Assignment Based on Deep Reinforcement Learning
Author information +
History +
PDF

Abstract

A systematic study was conducted on the issue of gate assignment, with the goal of minimizing the number of remote gate assignments and the idle time of near gates. A multi-objective mathematical model was proposed to address the multi-objective and multi-constraint characteristics of the problem. The model was designed to minimize the number of remote gate assignments and the idle time of near gates while taking into account parameters such as actual flight arrival and departure times, aircraft types, and the interrelationships among gates. The gate assignment process was optimized using the deep reinforcement learning method, specifically the deep deterministic policy gradient(DDPG) algorithm. To enhance the optimization ability and performance of the algorithm, an improved DDPG algorithm was developed by incorporating prioritized experience replay and multi-strategy exploration mechanisms. Comparative experiments were conducted, and the results show that the improved algorithm significantly reduces the number of remote gate assignments and optimized time utilization. The algorithm also achieves faster convergence and stronger global optimization capabilities, confirming its effectiveness.

Keywords

gate assignment / deep-learning / reinforcement-learning / deep deterministic policy gradient (DDPG) algorithm

Cite this article

Download citation ▾
Zheng XIANG, Qiu-yue WU, Tong CHU, Yi-yang YUE. Gate Assignment Based on Deep Reinforcement Learning. Science Technology and Engineering, 2025, 25(16): 6977-6984 DOI:10.12404/j.issn.1671-1815.2405560

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

PDF (4618KB)

18

Accesses

0

Citation

Detail

Sections
Recommended

/

〈 〉