An Iterated Local Search Heuristic for a Capacitated Hub Location Problem

Autor:	Inmaculada Rodríguez-Martín, Francisco Almeida, Juan Jose Salazar Gonzalez
Rok vydání:	2006
Předmět:	Scheme (programming language) Mathematical optimization Linear programming business.industry Iterated local search Heuristic Set (abstract data type) Linear programming relaxation Graph (abstract data type) Local search (optimization) business computer Mathematics computer.programming_language
Zdroj:	Hybrid Metaheuristics ISBN: 9783540463849 Hybrid Metaheuristics
DOI:	10.1007/11890584_6
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::35da47872b4b78c07cb83e8f2d410b66 https://doi.org/10.1007/11890584_6 Zobrazit plný text záznamu