Browsing by Author "Sugut, Ipek"

Now showing 1 - 2 of 2

Citation - WoS: 14
Citation - Scopus: 15
Integer and constraint programming model formulations for flight-gate assignment problem
(SPRINGER HEIDELBERG, 2022) M. Arslan Ornek; Cemalettin Ozturk; Ipek Sugut; Sugut, Ipek; Ornek, M. Arslan; Ozturk, Cemalettin
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.
Citation - WoS: 5
Citation - Scopus: 7
Model-based heuristic for counter assignment problem with operational constrains: A case study
(ELSEVIER SCI LTD, 2019) M. Arslan Ornek; Cemalettin Ozturk; Ipek Sugut; Sugut, Ipek; Ornek, M. Arslan; Ozturk, Cemalettin
Check-in counters have a great impact on the quality of service for airports. It is airport management's responsibility to provide check-in counters to airlines. Each check-in group (i.e. flights sharing the same resources) has a counter demand and this gives rise to a counter assignment problem. This is due to a number of objectives and constraints under which check-in groups are allocated to check-in counters. In this paper we develop an Integer Programming model to optimally assign incoming flights to check-in counters and propose a decomposition algorithm to solve the allocation problem in a reasonable time. Computational results from a medium sized airport indicate a better utilisation of check-in counters enabling airport management to reduce/postpone investment in additional check-in counters.