2021
DOI: 10.1109/tcyb.2019.2956974
|View full text |Cite
|
Sign up to set email alerts
|

A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(3 citation statements)
references
References 34 publications
0
3
0
Order By: Relevance
“…In addition, GAP tries to distribute gates to planes while taking airport operational effectiveness and traveler pleasure into account. Cai et al ( 2019 ) proposed CBR-GAM to solve the difficulties of traveler walking distance and high gateway allocation costs. The two objectives that need to be maximized, while meeting the restrictions on the constrained number of planes allocated to the apron, are the overall walking path of travelers and the overall robust cost of the gateway allocation.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, GAP tries to distribute gates to planes while taking airport operational effectiveness and traveler pleasure into account. Cai et al ( 2019 ) proposed CBR-GAM to solve the difficulties of traveler walking distance and high gateway allocation costs. The two objectives that need to be maximized, while meeting the restrictions on the constrained number of planes allocated to the apron, are the overall walking path of travelers and the overall robust cost of the gateway allocation.…”
Section: Related Workmentioning
confidence: 99%
“…Since the relationship between outbreak controls and transfer claims was not considered, the optimal results might not be yielded in actual operations. Recent studies focused on the multiobjective optimization of gate assignments [36,37]. In the optimization goal of gate assignment research, Cai et al [36] modeled the GAP as a biobjective constrained optimization problem, where the two objectives were the total walking distance of passengers and the total robust cost of the gate assignment.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Recent studies focused on the multiobjective optimization of gate assignments [36,37]. In the optimization goal of gate assignment research, Cai et al [36] modeled the GAP as a biobjective constrained optimization problem, where the two objectives were the total walking distance of passengers and the total robust cost of the gate assignment. Furthermore, Bi et al [37] solved the GAP, where the objective is to maximize the number of passengers through a jetway.…”
Section: Literature Reviewmentioning
confidence: 99%