Abstract
In this paper we present a hybrid heuristic for the capacitated p-median problem (CPMP). This problem considers a set of n points, each of them with a known demand, the objective consists of finding p medians and assign each point to exactly one median such that the total distance of assigned points to their corresponding medians is minimized, and the a capacity limit on the medians may not be exceeded. The purpose of this paper is to present a new hybrid heuristic to solve the CPMP, called Clustering Search (CS), which consists in detecting promising search areas based on clustering. Computational results show that the CS found the best known solutions in all most instances.
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
Chaves, A.A. and Lorena, L.A.N.: Hybrid algorithms with detection of promising areas for the prize collecting traveling salesman problem. Fifth international conference on hybrid intelligent systems (2005) 49–54
Diaz, J.A. and Fernandez E.: Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research, Vol. 169 (2006) 570–585
Fleszar, K. and Hindi, D.S.: An effective VNS for the capacitated p-median problem. European Journal of Operational Research (2007), doi:10.1016/j.ejor.2006.12.055
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of np-completeness, W.H. Freeman and Co. (1979)
Lorena L.A.N. and Senne E.L.F.: A column generation approach to capacitated p-median problems. Computers and Operational Research, Vol. 31 (1994) 863–876
Lorena L.A.N. and Senne E.L.F.: Local search heuristics for capacitated p-median problems, Networks and Spatial Economics, Vol. 3(4) (2003) 407–419
Maniezzo V, Mingozzi A and Baldacci R.: A bionomic approach to the capacitated p-median problem. J Heuristics, Vol. 4 (1998) 263–280
Laguna, M. and Martí, R.: Scatter Search—Methodology and Implementations in C, Kluwer Academic Publishers, Boston (2003)
Oliveira, A.C.M. and Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search.. Advances in Artificial Intelligence. Springer Lecture Notes in Artificial Intelligence Series (2004) 385–394
Osman, I.H., Ahmadi, S.: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint, Journal of the Operational Research Society, (2006) 1–15
Osman, I.H., Christofides, N.: Capacitated clustering problems by hybrid simulated annealing and tabu search. Intern. Trans. in Operational Research, Vol.1(3) (1994) 317–336
Scheuerer S. and Wendolsky R.: A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research, Vol. 169 (2006) 533–547
S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi, Optimization by Simulated Annealing, Science, Vol. 220(4598) (1983) 671–680
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chaves, A.A., de Assis Correa, F., Lorena, L.A.N. (2007). Clustering Search Heuristic for the Capacitated p-Median Problem. In: Corchado, E., Corchado, J.M., Abraham, A. (eds) Innovations in Hybrid Intelligent Systems. Advances in Soft Computing, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74972-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-74972-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74971-4
Online ISBN: 978-3-540-74972-1
eBook Packages: EngineeringEngineering (R0)