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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IBM ILOG CPLEX optimizer (November 2011), http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
Arakaki, R.G.I., Lorena, L.A.N.: A constructive genetic algorithm for the maximal covering location problem. In: Proceedings of the 4th Metaheuristics International Conference (MIC 2001), pp. 13–17 (2001)
Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135–4151 (2011)
Church, R., Velle, C.R.: The maximal covering location problem. Papers in Regional Science 32(1), 101–118 (1974)
Culberson, J.C., Luo, F.: Exploring the k-colorable landscape with iterated greedy. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pp. 245–284. American Mathematical Society (1996)
Galvao, R.D., Espejo, L.G.A., Boffey, B.: A comparison of lagrangean and surrogate relaxations for the maximal covering location problem. European Journal of Operational Research 124(2), 377–389 (2000)
Galvao, R.D., ReVelle, C.: A lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research 88(1), 114–123 (1996)
Lorena, L.A., Pereira, M.A.: A lagrangean/surrogate heuristic for the maximal covering location problem using hillsman’s edition. International Journal of Industrial Engineering 9, 57–67 (2001)
Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods 4(2), 253–261 (1983)
Reinelt, G.: The traveling salesman: computational solutions for TSP applications. Springer, Heidelberg (1994)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033–2049 (2007)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Senne, E.L.F., Pereira, M.A., Lorena, L.A.N.: A decomposition heuristic for the maximal covering location problem. Advances in Operations Research 2010 (2010)
Xia, L., Xie, M., Xu, W., Shao, J., Yin, W., Dong, J.: An empirical comparison of five efficient heuristics for maximal covering location problems. In: IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics (SOLI 2009), pp. 747–753 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-29124-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-29124-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29123-4
Online ISBN: 978-3-642-29124-1
eBook Packages: Computer ScienceComputer Science (R0)