A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem
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 schedul...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/8806135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832568169206644736 |
|---|---|
| author | Bin Deng Hao Guo Jingfeng Li Junfeng Huang Kaiyi Tang Weidong Li |
| author_facet | Bin Deng Hao Guo Jingfeng Li Junfeng Huang Kaiyi Tang Weidong Li |
| author_sort | Bin Deng |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-c40cf0f80b974be1a58dd39a04af724a |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-c40cf0f80b974be1a58dd39a04af724a2025-02-03T00:59:36ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/8806135A Game-Theoretic Approach for the Robust Daily Aircraft Routing ProblemBin Deng0Hao Guo1Jingfeng Li2Junfeng Huang3Kaiyi Tang4Weidong Li5School of Mathematics and StatisticsSchool of Mathematics and StatisticsChina Eastern Yunnan AirlinesChina Eastern Yunnan AirlinesChina Eastern Yunnan AirlinesSchool of Mathematics and StatisticsIn 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.http://dx.doi.org/10.1155/2022/8806135 |
| spellingShingle | Bin Deng Hao Guo Jingfeng Li Junfeng Huang Kaiyi Tang Weidong Li A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem Journal of Mathematics |
| title | A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem |
| title_full | A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem |
| title_fullStr | A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem |
| title_full_unstemmed | A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem |
| title_short | A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem |
| title_sort | game theoretic approach for the robust daily aircraft routing problem |
| url | http://dx.doi.org/10.1155/2022/8806135 |
| work_keys_str_mv | AT bindeng agametheoreticapproachfortherobustdailyaircraftroutingproblem AT haoguo agametheoreticapproachfortherobustdailyaircraftroutingproblem AT jingfengli agametheoreticapproachfortherobustdailyaircraftroutingproblem AT junfenghuang agametheoreticapproachfortherobustdailyaircraftroutingproblem AT kaiyitang agametheoreticapproachfortherobustdailyaircraftroutingproblem AT weidongli agametheoreticapproachfortherobustdailyaircraftroutingproblem AT bindeng gametheoreticapproachfortherobustdailyaircraftroutingproblem AT haoguo gametheoreticapproachfortherobustdailyaircraftroutingproblem AT jingfengli gametheoreticapproachfortherobustdailyaircraftroutingproblem AT junfenghuang gametheoreticapproachfortherobustdailyaircraftroutingproblem AT kaiyitang gametheoreticapproachfortherobustdailyaircraftroutingproblem AT weidongli gametheoreticapproachfortherobustdailyaircraftroutingproblem |