An iterated local search heuristic for a capacitated hub location problem

Authors:
Inmaculada Rodríguez-Martín;Juan-José Salazar-González
Affiliations:
DEIOC, Universidad de La Laguna, La Laguna, Tenerife, Spain;DEIOC, Universidad de La Laguna, La Laguna, Tenerife, Spain
Venue:
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Year:
2006

Citing 5
Cited 3

Network Design Using Cut Inequalities

SIAM Journal on Optimization
HubLocator: an exact solution method for the multiple allocation hub location problem

Computers and Operations Research - Location analysis
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
Solving the Hub location problem in telecommunication network design: A local search approach

Networks
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)

Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report

Computers and Operations Research
An evolutionary-based approach for solving a capacitated hub location problem

Applied Soft Computing
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a capacitated hub problem consisting of choosing the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complete. For solving this problem we propose a heuristic approach that makes use of a linear programming relaxation in an Iterated Local Search scheme. The heuristic turns out to be very effective and the results of the computational experiments show that near-optimal solutions can be derived rapidly for instances of large size.