Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Branch-and-bound algorithm for airport gate assignment problem
Download
index.pdf
Date
2019
Author
Alanlı, Kerem
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
229
views
131
downloads
Cite This
In this study, we consider an airport gate assignment problem that assigns a number of aircraft to a set of gates so as to minimize total walking distance travelled by all passengers. The aircraft that cannot be assigned to any gate due to overlaps are directed to an apron. The problem is formulated as a mixed-integer nonlinear programming model and then it is linearized. A branch-and-bound algorithm that employs powerful bounding mechanisms is developed. The results of the computational experiment have shown that the mathematical model can handle small sized problem instances, while the branch-and-bound solves relatively larger instances in reasonable time.
Subject Keywords
Assignment problems (Programming).
,
Keywords: Airport Gate Assignment Problem
,
Mixed Integer Linear Programming
,
Branch-and-Bound Algorithm.
URI
http://etd.lib.metu.edu.tr/upload/12624257/index.pdf
https://hdl.handle.net/11511/44922
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
An airport gate reassignment problem with two criteria
Poyraz, Dursen Deniz; Azizoğlu, Meral; Department of Industrial Engineering (2022-7)
In this study, we consider an airport gate reassignment problem where the aircraft are already assigned to the gates and a disruption occurs at some of the gates. After the disruption, the aircraft are reassigned to the gates considering efficiency and stability measures. Our efficiency criterion focuses on the maximum utilization of the gates in terms of both the number of aircraft and the number of passengers in these aircraft. On the other hand, our stability criterion is concerned with remaining as clo...
Exact and heuristic solution approaches for the airport gate assignment problem
Karsu, Özlem; Azizoğlu, Meral; Alanlı, Kerem (2021-01-01)
© 2021 Elsevier LtdIn this study, we consider an airport gate assignment problem that assigns a set of aircraft to a set of gates. The aircraft that cannot be assigned to any gate are directed to an apron. We aim to make aircraft-gate assignments so as to minimize the number of aircraft assigned to apron and among the apron usage minimizing solutions, we aim to minimize total walking distance travelled by all passengers. The problem is formulated as a mixed-integer nonlinear programming model and then it is...
A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves
Cinar, Volkan; ÖNCAN, TEMEL; Süral, Haldun (2010-04-09)
In this work, we consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), which is an extension of the well-known NP-hard Traveling Salesman Problem. We propose a Genetic Algorithm (GA) based on a specially tailored tour improvement procedure for the TSPPD. Computational experiments are reported on the test instances taken from the literature. The experimental results suggest that the proposed GA yields a promising performance in terms of both accuracy and efficiency compared to existing al...
A column generation approach for the location-routing problem with time windows
Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01)
The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...
Analysis of flow structure in a helicopter cabin to improve the thermal comfort using cfd modeling
Şahin, Doruk; Yavuz, Mehmet Metin (null; 2019-09-20)
Proper distribution of conditioned air inside the cabins of passenger transportation type aircrafts is crucial in terms of passengers? comfort. In the present study, computational fluid dynamics (CFD) models are developed using ANSYS FLUENT to investigate the thermal comfort levels of the passengers in a newly designed passenger transportation helicopter. The results reveal that the performance of the existing personalized air distribution system of the helicopter is inadequate to provide a comfortable envi...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Alanlı, “A Branch-and-bound algorithm for airport gate assignment problem,” Thesis (M.S.) -- Graduate School of Natural and Applied Sciences. Industrial Engineering., Middle East Technical University, 2019.
