Integer and constraint programming model formulations for flight-gate assignment problem

Flight-gate assignment problems are complex real world problems involving different constraints. Some of these constraints include plane-gate eligibility, assigning planes of the same airline and planes getting service from the same ground handling companies to adjacent gates, buffers for changes in...

Full description

Saved in:
Bibliographic Details
Published in:Operational research Vol. 22; no. 1; pp. 135 - 163
Main Authors: Ornek, M. Arslan, Ozturk, Cemalettin, Sugut, Ipek
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
Springer Nature B.V
Subjects:
Airports
Business and Management
Complexity
Computational Intelligence
Constraint modelling
Ground handling
Integer programming
Management Science
Operations Research
Operations Research/Decision Theory
Original Paper
Scheduling
Integer programming
Flight-gate assignment problem
Constraint programming
ISSN:1109-2858, 1866-1505
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Flight-gate assignment problems are complex real world problems involving different constraints. Some of these constraints include plane-gate eligibility, assigning planes of the same airline and planes getting service from the same ground handling companies to adjacent gates, buffers for changes in flight schedules, night stand flights, priority of some gates over others, and so on. In literature there are numerous models to solve this highly complicated problem and tackle its complexity. In this study, first, we propose two different integer programming models, namely, timetabling and assignment based models, and then a scheduling based constraint programming model to solve the problem to optimality. These models prove to be highly efficient in that the computational times are quite short. We also present the results for one day operation of an airport using real data. Finally, we present our conclusions based on our study along with the possible further research.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-020-00563-9