An Iterated Local Search Heuristic for a Capacitated Hub Location Problem
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.
KeywordsLocal Search Linear Programming Relaxation Local Search Procedure Mixed Integer Programming Model Good Feasible Solution
Unable to display preview. Download preview PDF.
- 11.Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, Kluwer’s International Series in Operations Research & Management Science, Norwell (2002)Google Scholar