.png){kind=icon}
Return
A column generation-based algorithm for gate assignment problem with combinational gates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2023.121792.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The gate assignment is a complicated real-world problem occurring in airports. The present paper studies the gate assignment problem with combinational gates. The problem is multi-objective by nature, concerning four objectives. Among those objectives, the number of passengers allocated to nearby gates is aimed to be maximized. The remaining objectives are targeted to be minimized, i.e., the total passenger walking distance, the amount of carbon dioxide emitted by the aircraft assigned to remote gates, and the total distance traveled by the shuttle bus. To solve this problem, we formulate an integer programming model. A column generation-based algorithm based on a set-partitioning model is proposed to solve the problem effectively. In addition, the Pareto Local Search algorithm is adopted to obtain non-dominated solutions. Computational experiments show that the effectiveness of our model is verified through tests with instances of different sizes. The column generation -based algorithm can obtain the optimal solution or the approximately optimal solution with a small gap in a reasonable time. The results of the Pareto Local Search algorithm show the interaction between multiple objectives.
Keywords:
Transportation
Gate assignment problem
Column generation
Subset -row inequalities
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.9W
Organization
Cited Papers
An NMR crystallography DFT-D approach to analyse the role of intermolecular hydrogen bonding and π–π interactions in driving cocrystallisation of indomethacin and nicotinamide.png)
CrystEngComm
CrystEngCommIF0
PREAI
ShareSave
ShareSaveShareSave
View more