Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/24175
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Breakout Local Search for the Multi-Objective Gate Allocation Problem
Authors: Benlic, Una
Burke, Edmund K
Woodward, John
Contact Email: jrw@cs.stir.ac.uk
Keywords: Gate allocation
Airports
Breakout local search
Greedy constructive heuristic
Adaptive diversification
Metaheuristics
Issue Date: 30-Aug-2016
Publisher: Elsevier
Citation: Benlic U, Burke EK & Woodward J Breakout Local Search for the Multi-Objective Gate Allocation Problem, Computers and Operations Research.
Abstract: The problem of assigning gates to arriving and departing flights is one of the most important problems in airport operations. We take into account the real multi-criteria nature of the problem by optimizing a total of nine gate allocation objectives that are oriented both on convenience for airport/airline services and passenger comfort. As far as we are aware, this is the largest number of objectives jointly optimized in the GAP literature. Given the complexity of the considered problem, we propose a heuristic approach based on the Breakout Local Search (BLS) framework. BLS is a recent variant of the Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce an appropriate degree of diversification by determining adaptively the number and type of moves for the next perturbation phase. Moreover, we use a new memory-based greedy constructive heuristic to generate a starting point for BLS. Benchmark instances used for our experiments and comparisons are based on information provided by Manchester Airport.
Type: Journal Article
URI: http://hdl.handle.net/1893/24175
DOI Link: http://dx.doi.org/10.1016/j.cor.2016.08.010
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Affiliation: Queen Mary, University of London
Queen Mary, University of London
Computing Science - CSM Dept

Files in This Item:
File Description SizeFormat 
1-s2.0-S0305054816302052-main.pdf730.12 kBAdobe PDFUnder Embargo until 31/12/2999     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.

This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.