2026· MATEC Web of Conferences· 0 citations· 34 references
TL;DR
The proposed hierarchical multi-agent proximal policy optimization framework can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
Abstract
Civil aviation fleet planning is a typical long-horizon operations research problem, for which the problem formulation and algorithms could play critical roles in either the computational efficiency or the solution quality. However, conventional meta-heuristic approaches have some inherent drawbacks: during the optimization process, the model is unable to "learn" efficiently from infeasible solutions and gradually concentrate on high feasibility regions, leading to an exponential increase in complexity with increasing planning horizon, and their randomness prevents an optimality guarantee on individual instances. In this paper, we introduce a hierarchical multi-agent proximal policy optimization framework to tackle these problems. To effectively handle ultralong episodes, our approach builds up the optimization architecture by reward shaping and environment designing within a base PPO, which is then boosted through multi-agent coordination and hierarchical decomposition. Large language model (LLM)-based agent workflows are deployed to automatically tune hyperparameters toward the specific domains' performances. Validated on realistic flight data from 2019 shared by our airline partner, our results show that the proposed method can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
The experimental results demonstrate that RLEA outperforms the previous state-of-the-ar method, achieving a 16.67% higher success rate while significantly reducing runtime errors, and validate that integrating reinforcement learning with LLM-based reasoning is highly effective for automated optimization modeling.
Yi Chen, Zi-Pei Yu, Jia-Hai Wang et al.· 1 citation
Focusing on multi-agent path finding as an exemplary problem, this paper proposes to simplify two popular approaches to MAPF, namely multi-agent reinforcement learning and adaptive search, to enable seamless combination and transferability of methods without substantial engineering effort.
Thomy Phan· Proceedings of the Thirty-Fi...· 0 citations
This paper presents a rolling-horizon replanning framework for multi-UAV missions considering fuel constraints in dynamic environments. At each decision epoch, a re-optimization subproblem is solved to minimize the total travel distance of all agents (UAVs) while visiting remaining task locations, considering en-rout...
Beomjin Gwon, Euihyeon Choi, Jeonghun Lee et al.· International Journal of Aer...· 0 citations
This work introduces an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions, which are then further optimized by a genetic algorithm, enabling real-time and interactive routing at scale.
Ido Greenberg, P. Sielski, Hugo Linsenmaier et al.· Communications AI & Computin...· 1 citation
In recent years, constrained multi-objective optimization problems(CMOPs) remain challenging due to the complex structure of feasible regions, the difficulty of balancing convergence and diversity, and the lack of adaptive operator scheduling mechanisms. To address these issues, this paper proposes a hierarchical reinf...
Lu-Peng Hao, Yahui Shan, Guangyin Jin et al.· Journal of King Saud Univers...· 0 citations
This work provides a feasible technical pathway and reproducible evaluation benchmark for the collaborative deployment of lightweight LLM planner, sub-goal guidance, sensor observations, cooperative reward, and reward shaping components and quantifies the indispensability of the LLM planner.
Yuting Cao, Zheng Zhao, Jiekai Wu et al.· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.