|
Título:
|
Iterated greedy algorithms for the maximal covering location problem
|
|
Autor/a:
|
Rodríguez, Francisco J.; Blum, Christian; Lozano, Manuel; García Martínez, Carlos
|
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
|
Abstract:
|
The problem of allocating a set of facilities in order to maximise
the sum of the demands of the covered clients is known as the
maximal covering location problem. In this work we tackle this problem
by means of iterated greedy algorithms. These algorithms iteratively refine
a solution by partial destruction and reconstruction, using a greedy
constructive procedure. Iterated greedy algorithms have been applied
successfully to solve a considerable number of problems. With the aim of
providing additional results and insights along this line of research, this
paper proposes two new iterated greedy algorithms that incorporate two
innovative components: a population of solutions optimised in parallel
by the iterated greedy algorithm, and an improvement procedure that
explores a large neighbourhood by means of an exact solver. The benefits
of the proposal in comparison to a recently proposed decomposition
heuristic and a standalone exact solver are experimentally shown. |
|
Abstract:
|
Peer Reviewed |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Sistemes experts
-Iterated greedy algorithm
-Large neighbourhood search
-Maximal covering location problem
-Algorismes -- Informàtica |
|
Derechos:
|
|
|
Tipo de documento:
|
Artículo - Versión publicada
Artículo |
|
Compartir:
|
|
