{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:57:25Z","timestamp":1761947845437},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,12,16]],"date-time":"2012-12-16T00:00:00Z","timestamp":1355616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10288-012-0223-y","type":"journal-article","created":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T04:05:03Z","timestamp":1355544303000},"page":"229-248","source":"Crossref","is-referenced-by-count":8,"title":["An efficient heuristic algorithm for the capacitated $$p-\\!$$ median problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Masoud","family":"Yaghini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Momeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadreza","family":"Sarmadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid Reza","family":"Ahadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,16]]},"reference":[{"key":"223_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-D\u00edaz","year":"2006","unstructured":"Adenso-D\u00edaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54:99\u2013114","journal-title":"Oper Res"},{"key":"223_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"223_CR3","first-page":"43","volume":"7","author":"M Boccia","year":"2008","unstructured":"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\u201358","journal-title":"J Math"},{"key":"223_CR4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper Res 48:444\u2013460","journal-title":"Oper Res"},{"key":"223_CR5","first-page":"319","volume":"4","author":"A Ceselli","year":"2003","unstructured":"Ceselli A (2003) Two exact algorithms for the capacitated $$p$$ -median problem. J Oper Res 4:319\u2013340","journal-title":"J Oper Res"},{"key":"223_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A Ceselli","year":"2005","unstructured":"Ceselli A, Righini G (2005) A branch-and-price algorithm for the capacitated $$p$$ -median problem. Networks 45:125\u2013142","journal-title":"Networks"},{"key":"223_CR7","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.cor.2008.09.011","volume":"37","author":"AA Chaves","year":"2010","unstructured":"Chaves AA, Lorena LAN (2010) Clustering search heuristic for the capacitated $$p$$ -median problem. Comput Oper Res 37:552\u2013558","journal-title":"Comput Oper Res"},{"key":"223_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37\u201353","journal-title":"SIAM Rev"},{"key":"223_CR9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/B:NUMA.0000021767.42899.31","volume":"35","author":"ES Correa","year":"2004","unstructured":"Correa ES, Steiner MTA, Freitas AA, Carnieri C (2004) A genetic algorithm for solving a capacitated $$p$$ -median problem. Numer Algorithms 35:373\u2013388","journal-title":"Numer Algorithms"},{"key":"223_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1026569813391","volume":"7","author":"S Coy","year":"2001","unstructured":"Coy S, Golden B, Runger G, Wasil E (2001) Using experimental design to find effective parameter settings for heuristics. J Heuristics 7:77\u201397","journal-title":"J Heuristics"},{"key":"223_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71\u201390","journal-title":"Math Program"},{"key":"223_CR12","first-page":"163","volume":"29","author":"FO Fran\u00e7a De","year":"2005","unstructured":"De Fran\u00e7a FO, Von Zuben FJ, De Castro LN (2005) Max min ant system and capacitated $$p$$ -medians: extension and improved solutions. Informatica 29:163\u2013171","journal-title":"Informatica"},{"key":"223_CR13","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ejor.2004.08.016","volume":"169","author":"E Fernandez","year":"2006","unstructured":"Fernandez E (2006) Hybrid scatter search and path relinking for the capacitated $$p$$ -median problem. Eur J Oper Res 169:570\u2013585","journal-title":"Eur J Oper Res"},{"key":"223_CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/j.cie.2007.06.001","volume":"56","author":"N F\u0131\u011flal\u0131","year":"2009","unstructured":"F\u0131\u011flal\u0131 N, \u00d6zkale C, Engin O, F\u0131\u011flal\u0131 A (2009) Investigation of ant system parameter interactions by using design of experiments for job shop scheduling problems. Comput Ind Eng 56:538\u2013559","journal-title":"Comput Ind Eng"},{"key":"223_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98:23\u201347","journal-title":"Math Program"},{"key":"223_CR16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K Fleszar","year":"2008","unstructured":"Fleszar K, Hindi KS (2008) An effective VNS for the capacitated $$p$$ -median problem. Eur J Oper Res 191:612\u2013622","journal-title":"Eur J Oper Res"},{"key":"223_CR17","volume-title":"Mathematical statistics","author":"JE Freund","year":"1992","unstructured":"Freund JE (1992) Mathematical statistics, 5th edn. Prentice-Hall, Inc, Englewood Cliffs","edition":"5"},{"key":"223_CR18","volume-title":"Computers and intractability: a guide to the theory of NP completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. WH Freeman and Company, San Francisco"},{"key":"223_CR19","first-page":"387","volume":"20","author":"CR Houck","year":"1996","unstructured":"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\u2013396","journal-title":"Eur J Oper Res"},{"key":"223_CR20","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"LAN Lorena","year":"2004","unstructured":"Lorena LAN, Senne ELF (2004) A column generation approach to capacitated $$p$$ -median problems. Comput Oper Res 31:863\u2013876","journal-title":"Comput Oper Res"},{"key":"223_CR21","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Hansen P, Moreno-P\u00e9rez JA (2007) The $$p$$ -median problem: a survey of metaheuristic approaches. Eur J Oper Res 179:927\u2013939","journal-title":"Eur J Oper Res"},{"key":"223_CR22","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2009","unstructured":"Montgomery DC (2009) Design and analysis of experiments, 7th edn. Wiley, New York","edition":"7"},{"key":"223_CR23","unstructured":"Montgomery DC, Runger G (2006) Applied statistics and probability for engineering, 3rd edn. Wiley, New York"},{"key":"223_CR24","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"I Osman","year":"1994","unstructured":"Osman I, Christofides N (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. Int Trans Oper Res 1:317\u2013336","journal-title":"Int Trans Oper Res"},{"key":"223_CR25","volume-title":"Numerical recipes in pascal: the art of scientific computing","author":"WH Press","year":"1989","unstructured":"Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1989) Numerical recipes in pascal: the art of scientific computing. Cambridge University Press, Cambridge"},{"key":"223_CR26","doi-asserted-by":"crossref","unstructured":"Reese J (2006) Solution methods for the $$p$$ -median problem: an annotated bibliography. Networks 48: 125\u2013142","DOI":"10.1002\/net.20128"},{"key":"223_CR27","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10479-006-0154-0","volume":"150","author":"GC Resende","year":"2007","unstructured":"Resende GC, Werneck RF (2007) A fast swap-based local search procedure for location problems. Ann Oper Res 150:205\u2013230","journal-title":"Ann Oper Res"},{"key":"223_CR28","doi-asserted-by":"crossref","unstructured":"Ridge E, Kudenko D (2007) Tuning the performance of the MMAS heuristic. In: St\u00fctzle T, Birattari M, Hoos HH (eds.) Proceedings international workshop on engineering stochastic local search algorithms (SLS 2007), 46\u201360","DOI":"10.1007\/978-3-540-74446-7_4"},{"key":"223_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013286","DOI":"10.1007\/978-3-642-02538-9_11"},{"key":"223_CR30","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1026131531250","volume":"123","author":"S Salhi","year":"2003","unstructured":"Salhi S, Gamal MDH (2003) A genetic algorithm based approach for the uncapacitated continuous location-allocation problem. Ann Oper Res 123:203\u2013222","journal-title":"Ann Oper Res"},{"key":"223_CR31","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2004.08.014","volume":"169","author":"S Scheuerer","year":"2006","unstructured":"Scheuerer S, Wendolsky R (2006) A scatter search heuristic for the capacitated clustering problem. Eur J Oper Res 169:533\u2013547","journal-title":"Eur J Oper Res"},{"key":"223_CR32","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, New York"},{"key":"223_CR33","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955\u2013961","journal-title":"Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0223-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0223-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0223-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T03:19:45Z","timestamp":1562469585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0223-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,16]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0223-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,16]]}}}