Breakout local search for the multi-objective gate allocation problem

DOI10.1016/J.COR.2016.08.010zbMath1391.90647OpenAlexW2508609836MaRDI QIDQ1652056

Una Benlic, John R. Woodward, Edmund Kieran Burke

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.010

zbMATH Keywords

airportsmetaheuristicsadaptive diversificationbreakout local searchgate allocationgreedy constructive heuristic

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

Learning-driven feasible and infeasible tabu search for airport gate assignment ⋮ Research on airport multi-objective optimization of stand allocation based on simulated annealing algorithm

Cites Work

• Exact and heuristic approaches to the airport stand allocation problem
• Procedures for providing robust gate assignments for arriving aircrafts
• The over-constrained airport gate assignment problem
• Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol
• Models and a genetic algorithm for static aircraft-gate assignment problem

This page was built for publication: Breakout local search for the multi-objective gate allocation problem