Abstract
A metaheuristic for the capacitated vertex p-center problem is presented. This is a well-known location problem that consists of placing p facilities and assigning customers to these in such a way that the largest distance between any customer and its associated facility is minimized. In addition, a capacity on demand for each facility is considered. The proposed metaheuristic framework integrates several components such as a greedy randomized adaptive procedure with biased sampling in its construction phase and iterated greedy with a variable neighborhood descent in its local search phase. The overall performance of the heuristic is numerically assessed on widely used benchmarks on location literature. The results indicate the proposed heuristic outperforms the best existing heuristic.
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.
Similar content being viewed by others
References
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I: The p-centers. SIAM Journal on Applied Mathematics 37, 513–538 (1979)
Elloumi, S., Labbé, M., Pochet, Y.: A new formulation and resolution method for the p-center problem. INFORMS Journal on Computing 16(1), 84–94 (2004)
Özsoy, F.A., Pınar, M.Ç.: An exact algorithm for the capacitated vertex p-center problem. Computers & Operations Research 33(5), 1420–1436 (2006)
Albareda-Sambola, M., Díaz-García, J.A., Fernández, E.: Lagrangean duals and exact solution to the capacitated p-center problem. European Journal of Operational Research 201(1), 71–81 (2010)
Scaparra, M.P., Pallottino, S., Scutellà, M.G.: Large-scale local search heuristics for the capacitated vertex p-center problem. Networks 43(4), 241–255 (2004)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2), 109–133 (1995)
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)
Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)
Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics, 2nd edn. International Series in Operations Research & Management Science, vol. 146. Springer, New York (2010)
Dyer, M.E., Frieze, A.: A simple heuristic for the p-center problem. Operations Research Letters 3(6), 285–288 (1985)
Bresina, J.L.: Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI 1996, Portland, USA, vol. 1, pp. 271–278. AAAI Press (1996)
Loosemore, S., Stallman, R.M., McGrath, R., Oram, A., Drepper, U.: The GNU C Library Reference Manual: For version 2.17. Free Software Foundation, Boston, USA (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quevedo-Orozco, D.R., Ríos-Mercado, R.Z. (2013). A New Heuristic for the Capacitated Vertex p-Center Problem. In: Bielza, C., et al. Advances in Artificial Intelligence. CAEPIA 2013. Lecture Notes in Computer Science(), vol 8109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40643-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-40643-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40642-3
Online ISBN: 978-3-642-40643-0
eBook Packages: Computer ScienceComputer Science (R0)