| Autor: |
Deng, Bin, Guo, Hao, Li, Jingfeng, Huang, Junfeng, Tang, Kaiyi, Li, Weidong |
| Zdroj: |
Journal of Mathematics; 2022, Vol. 2022 Issue: 1 |
| Abstrakt: |
In the operation of airlines, the most important link is determining the route and scheduling of aircraft. The key to this problem is to input the flight segment and aircraft type and finally determine all flight segments for each aircraft. In this paper, we focus on finding feasible, robust scheduling for various uncertainties in the flight process. This paper presents a new robust integer mathematical model based on game theory that considers daily aircraft routing. Then, in order to find the suboptimal solution to a large-scale integer programming problem in a limited amount of time, a heuristic algorithm integrating a column generation algorithm and variable domain search is introduced. In addition, we use the data of a Chinese airline to verify, and the experimental results show that the model proposed by us is more robust than the model in general. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Plný text