| 基于改进遗传算法的航班-登机口分配多目标优化 |
| |
| 引用本文： | 余朝军,江驹,徐海燕,朱平.基于改进遗传算法的航班-登机口分配多目标优化[J].交通运输工程学报,2020,20(2):121-130. |
| |
| 作者姓名： | 余朝军 江驹 徐海燕 朱平 |
| |
| 作者单位： | 1.南京航空航天大学自动化学院, 江苏 南京 2111062.南京航空航天大学经济与管理学院, 江苏 南京 211106 |
| |
| 基金项目： | 国家自然科学基金;研究生科研创新项目 |
| |
| 摘 要： | 为提高现代机场的资源利用效率和乘客换乘体验, 研究了多目标航班-登机口分配问题; 在考虑航班类型约束、飞机机体类型约束和转场时间间隔约束的基础上, 以分配在固定登机口的航班数量最多、使用的固定登机口数量最少和乘客换乘紧张度最小为目标函数, 建立了航班-登机口分配的多目标非线性0-1整数规划模型, 并设计了一种改进型基因编码的遗传算法以提高求解效率; 基因个体采用两段式整数编码, 设计了该编码方式到可行解的映射流程, 同时从理论上证明该编码方式可以映射到最优解; 对两段基因编码分别设计了不同的交叉算子和变异算子, 避免产生非可行个体; 为验证算法的有效性, 基于某大规模机场的实际运营数据, 对比了改进型遗传算法与MATLAB内置遗传算法。计算结果表明: 采用改进型遗传算法使得安排在固定登机口的航班数目增大5%, 乘客换乘总紧张度减小3%, 乘客换乘平均紧张度减小32%, 占用的固定登机口数量相同, 安排在固定登机口的乘客数量增大20%, 算法运行时间减小8%, 说明改进型遗传算法性能更好, 可提高登机口的利用效率和乘客的换乘舒适度; 在改进型遗传算法的优化过程中, 航班数量目标和登机口数量目标在130次迭代时寻到最优解, 换乘紧张度目标在400次迭后基本收敛, 且最优结果对应的航班时序合理, 说明该算法的迭代收敛速度快, 优化结果合理。
|
| 关 键 词： | 交通规划 大规模优化问题 航班-登机口分配 遗传算法 基因编码 多目标优化 |
| 收稿时间： | 2019-10-22 |
Multi-objective optimization of flight-gate assignment based on improved genetic algorithm |
| |
| YU Chao-jun,JIANG Ju,XU Hai-yan,ZHU Ping.Multi-objective optimization of flight-gate assignment based on improved genetic algorithm[J].Journal of Traffic and Transportation Engineering,2020,20(2):121-130. |
| |
| Authors: | YU Chao-jun JIANG Ju XU Hai-yan ZHU Ping |
| |
| Affiliation: | 1.College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, Jiangsu, China2.College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, Jiangsu, China |
| |
| Abstract: | In order to improve the resource utilization efficiency and passenger transfer experience of modern airports, the multi-objective flight-gate assignment problem was studied. Considering the constraints of flight type, aircraft body type and transition time interval, a multi-objective nonlinear 0-1 integer planning model of the flight-gate assignment was established by taking the maximum number of flights allocated at a fixed gate, the minimum number of used fixed gates and the minimum passenger transfer tension as the objective functions. Then a genetic algorithm based on the improved gene coding was designed to improve the solving efficiency of the model. The gene individual adopts two-stage integer coding, and the mapping process from the gene coding method to a feasible solution was designed. Meanwhile, it was theoretically proved that the gene coding method could be mapped to the optimal solution. Different crossover operators and mutation operators were designed for the two stages of gene coding to avoid infeasible individuals. In order to verify the effectiveness of the algorithm, based on the actual operation data of a large-scale airport, the improved genetic algorithm and MATLAB built-in genetic algorithm were compared. Calculation result shows that with the improved genetic algorithm, the number of flights assigned to the fixed gates increases by 5%, the total transfer tension of passenger decreases by 3%, the average transfer tension of passenger decreases by 32%, the number of used fixed gates stays the same, the passengers assigned to the fixed gates increase by 20%, and the running time of the algorithm reduces by 8%, which shows that the improved genetic algorithm has better performance and can improve the gate utilization efficiency and passenger transfer comfort. In the optimization process of the improved genetic algorithm, the number objectives of flights and gates reach the best in 130 iterations, the transfer tension basically converges after 400 iterations, and the flight schedule generated by the optimal solution is reasonable, which indicates that the algorithm has fast iterative convergence speed and reasonable optimization result. |
| |
| Keywords: | |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《交通运输工程学报》浏览原始摘要信息 |
|
点击此处可从《交通运输工程学报》下载全文 |
|
