A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm
| العنوان: | A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm |
|---|---|
| المؤلفون: | Mustafa Misir, Wenxue Sun, Xiaoping Li, Kay Chen Tan, Xinye Cai, Tao Xu, Zhun Fan |
| المساهمون: | İstinye Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü, Misir, Mustafa, A-6739-2010 |
| المصدر: | IEEE Transactions on Cybernetics. 51:4488-4500 |
| بيانات النشر: | Institute of Electrical and Electronics Engineers (IEEE), 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | Optimization, Large Neighborhood Search (LNS), Speedup, Aircraft, Airports, Computer science, Robust Gate Assignment, 0211 other engineering and technologies, 02 engineering and technology, Logic Gates, Local optimum, 0202 electrical engineering, electronic engineering, information engineering, Bi objective, Electrical and Electronic Engineering, Robustness, 021103 operations research, Atmospheric Modeling, Legged Locomotion, Bi-Objective Optimization, Computer Science Applications, Human-Computer Interaction, Control and Systems Engineering, Logic gate, Pareto Local Search (PLS), 020201 artificial intelligence & image processing, Solutions of Interest, Algorithm, Assignment problem, Software, Information Systems |
| الوصف: | 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. WOS:000696078900016 31899446 Q1 |
| وصف الملف: | application/pdf |
| تدمد: | 2168-2275 2168-2267 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::299f3bc0468af65e11bf7a7ec0327fb8 https://doi.org/10.1109/tcyb.2019.2956974 |
| حقوق: | CLOSED |
| رقم الأكسشن: | edsair.doi.dedup.....299f3bc0468af65e11bf7a7ec0327fb8 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 21682275 21682267 |
|---|