Iterated Greedy Algorithms for the Maximal Covering Location Problem

  • Francisco J. Rodriguez
  • Christian Blum
  • Manuel Lozano
  • Carlos García-Martínez
Conference paper

DOI: 10.1007/978-3-642-29124-1_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7245)
Cite this paper as:
Rodriguez F.J., Blum C., Lozano M., García-Martínez C. (2012) Iterated Greedy Algorithms for the Maximal Covering Location Problem. In: Hao JK., Middendorf M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg

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.

Keywords

iterated greedy algorithm large neighbourhood search maximal covering location problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Francisco J. Rodriguez
    • 1
  • Christian Blum
    • 2
  • Manuel Lozano
    • 1
  • Carlos García-Martínez
    • 3
  1. 1.Department of Computer Science and Artificial IntelligenceUniversity of GranadaGranadaSpain
  2. 2.ALBCOM Research GroupTechnical University of CataloniaBarcelonaSpain
  3. 3.Department of Computing and Numerical AnalysisUniversity of CórdobaCórdobaSpain

Personalised recommendations