A branch-and-bound algorithm for airport gate assignment problem

Alanli, Kerem
Karsu, Ozlem
Azizoğlu, Meral


A Branch-and-bound algorithm for airport gate assignment problem
Alanlı, Kerem; Azizoğlu, Meral; Department of Industrial Engineering (2019)
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 sho...
A genetic algorithm for maximum-weighted tree matching problem
Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-09-01)
In hierarchal organizations, for assigning tasks to the divisions of the organization some constraints must be satisfied. This article investigates one such problem in which there are k different tasks to be accomplished and each division's performance on each task may be different and represented by a scalar value. In this article we formally introduce this real life decision problem, named as Maximum-Weighted Tree Matching Problem, and propose a genetic algorithm solution to it, and give some experimental...
A dynamic programming algorithm for tree-like weighted set packing problem
Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-10-15)
In hierarchical organizations, hierarchical structures naturally correspond to nested sets. That is, we have a collection of sets such that for any two sets, either one of them is a subset of the other, or they are disjoint. In other words, a nested set system forms a hierarchy in the form of a tree structure. The task assignment problem on such hierarchical organizations is a real life problem. In this paper, we introduce the tree-like weighted set packing problem, which is a weighted set packing problem r...
A branch and bound algorithm for resource leveling problem
Mutlu, Mustafa Çağdaş; Sönmez, Rifat; Department of Civil Engineering (2010)
Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal...
A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem
Cinel, Sertac; Bazlamaçcı, Cüneyt Fehmi (Institute of Electrical and Electronics Engineers (IEEE), 2008-11-01)
Rectilinear Steiner minimal tree (RSMT) problem finds a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments and by using extra points if necessary. In this paper, to speedup the RSMT construction, two recently developed successful heuristic algorithms, namely rectilinear steiner tree (RST) by Zhou and hatched greedy algorithm (BGA) by Kahng et al., have been used as the basis. Following a slight modification on RST, which led to a nonrecursive and a con...
Citation Formats
K. Alanli, O. Karsu, and M. Azizoğlu, “A branch-and-bound algorithm for airport gate assignment problem,” 2019, Accessed: 00, 2021. [Online]. Available: https://www.euro-online.org/media_site/reports/EURO30_AB.pdf.