Abstract
The capacitated \(p\)-median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity limit. This paper presents an efficient heuristic algorithm based on the local branching and relaxation induced neighborhood search methods for the CPMP. The proposed algorithm is a heuristic technique that utilizes a general mixed integer programming solver to explore neighborhoods. The parameters of the proposed algorithm are tuned by design of experiments. The proposed method is tested on a large set of benchmark instances. The results show that the method outperforms the best method found in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adenso-Díaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54:99–114
Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072
Boccia M, Sforza A, Sterle C, Vasilyev I (2008) A cut and branch approach for the capacitated \(p-\)median problem based on fenchel cutting planes. J Math 7:43–58
Brimberg J (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper Res 48:444–460
Ceselli A (2003) Two exact algorithms for the capacitated \(p\)-median problem. J Oper Res 4:319–340
Ceselli A, Righini G (2005) A branch-and-price algorithm for the capacitated \(p\)-median problem. Networks 45:125–142
Chaves AA, Lorena LAN (2010) Clustering search heuristic for the capacitated \(p\)-median problem. Comput Oper Res 37:552–558
Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37–53
Correa ES, Steiner MTA, Freitas AA, Carnieri C (2004) A genetic algorithm for solving a capacitated \(p\)-median problem. Numer Algorithms 35:373–388
Coy S, Golden B, Runger G, Wasil E (2001) Using experimental design to find effective parameter settings for heuristics. J Heuristics 7:77–97
Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71–90
De França FO, Von Zuben FJ, De Castro LN (2005) Max min ant system and capacitated \(p\)-medians: extension and improved solutions. Informatica 29:163–171
Fernandez E (2006) Hybrid scatter search and path relinking for the capacitated \(p\)-median problem. Eur J Oper Res 169:570–585
Fığlalı N, Özkale C, Engin O, Fığlalı A (2009) Investigation of ant system parameter interactions by using design of experiments for job shop scheduling problems. Comput Ind Eng 56:538–559
Fischetti M, Lodi A (2003) Local branching. Math Program 98:23–47
Fleszar K, Hindi KS (2008) An effective VNS for the capacitated \(p\)-median problem. Eur J Oper Res 191:612–622
Freund JE (1992) Mathematical statistics, 5th edn. Prentice-Hall, Inc, Englewood Cliffs
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. WH Freeman and Company, San Francisco
Houck CR, Joines JA, Kay MG (1996) Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Eur J Oper Res 20:387–396
Lorena LAN, Senne ELF (2004) A column generation approach to capacitated \(p\)-median problems. Comput Oper Res 31:863–876
Mladenović N, Hansen P, Moreno-Pérez JA (2007) The \(p\)-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179:927–939
Montgomery DC (2009) Design and analysis of experiments, 7th edn. Wiley, New York
Montgomery DC, Runger G (2006) Applied statistics and probability for engineering, 3rd edn. Wiley, New York
Osman I, Christofides N (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. Int Trans Oper Res 1:317–336
Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1989) Numerical recipes in pascal: the art of scientific computing. Cambridge University Press, Cambridge
Reese J (2006) Solution methods for the \(p\)-median problem: an annotated bibliography. Networks 48: 125–142
Resende GC, Werneck RF (2007) A fast swap-based local search procedure for location problems. Ann Oper Res 150:205–230
Ridge E, Kudenko D (2007) Tuning the performance of the MMAS heuristic. In: Stützle T, Birattari M, Hoos HH (eds.) Proceedings international workshop on engineering stochastic local search algorithms (SLS 2007), 46–60
Ridge E, Kudenko D (2010) Tuning an algorithm using design of experiments, In: Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (eds.) Experimental methods for the analysis of optimization algorithms, pp 265–286
Salhi S, Gamal MDH (2003) A genetic algorithm based approach for the uncapacitated continuous location-allocation problem. Ann Oper Res 123:203–222
Scheuerer S, Wendolsky R (2006) A scatter search heuristic for the capacitated clustering problem. Eur J Oper Res 169:533–547
Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, New York
Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955–961
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yaghini, M., Momeni, M., Sarmadi, M. et al. An efficient heuristic algorithm for the capacitated \(p-\!\) median problem. 4OR-Q J Oper Res 11, 229–248 (2013). https://doi.org/10.1007/s10288-012-0223-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-012-0223-y
Keywords
- Location-allocation problem
- Capacitated p-median problem
- Heuristic algorithm
- Local branching algorithm
- Relaxation induced neighborhood search method