.png){kind=icon}
返回
A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2019.2956974.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The gate assignment problem (GAP) aims at assigning gates to aircraft considering operational efficiency of airport and satisfaction of passengers. Unlike the existing works, we model the GAP as a bi-objective constrained optimization problem. The total walking distance of passengers and the total robust cost of the gate assignment are the two objectives to be optimized, while satisfying the constraints regarding the limited number of flights assigned to apron, as well as three types of compatibility. A set of real instances is then constructed based on the data obtained from the Baiyun airport (CAN) in Guangzhou, China. A two-phase large neighborhood search (2PLNS) is proposed, which accommodates a greedy and stochastic strategy (GSS) for the large neighborhood search; both to speed up its convergence and to avoid local optima. The empirical analysis and results on both the synthetic instances and the constructed real-world instances show a better performance for the proposed 2PLNS as compared to many state-of-the-art algorithms in literature. An efficient way of choosing the tradeoff from a large number of nondominated solutions is also discussed in this article.
Keyword:
Logic gates
Optimization
Aircraft
Airports
Atmospheric modeling
Robustness
Legged locomotion
Bi-objective optimization
large neighborhood search (LNS)
Pareto local search (PLS)
robust gate assignment
solutions of interest
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏分享收藏
查看更多内容