Á. Corberán, R. Martí, J. Peiró
Many heuristics and metaheuristics have been proposed to solve different variants of hub location problems, including GRASP, VNS, tabu search, and several complex hybrid techniques. In this talk we present a simple, easily adaptable and powerful algorithm, based on the iterated greedy – strategic oscillation (SO) methodology. Our purpose is to investigate the SO proposal, which alternates between constructive and destructive phases as a basis for creating a competitive method for a capacitated version of the hub location problem.
We will also present a comparison between methods and optimal results. Computational outcomes on a large set of instances show that, while only small instances can be optimally solved with exact methods, our metaheuristic is able to find high-quality solutions on larger instances in short computing times, and outperforms the previous implementations.
Palabras clave / Keywords: hub location, strategic oscillation, metaheuristics
Programado
Sesión GT09-1: Optimización Heurística (HEURÍSTICA-1). Organizador: Juanjo Peiró
29 de mayo de 2018 17:00
Sala 6
