{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:12Z","timestamp":1759667652467},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s10479-005-2043-3","type":"journal-article","created":{"date-parts":[[2005,5,18]],"date-time":"2005-05-18T14:13:03Z","timestamp":1116425583000},"page":"145-173","source":"Crossref","is-referenced-by-count":31,"title":["Heuristic Procedures for Solving the Discrete Ordered Median Problem"],"prefix":"10.1007","volume":"136","author":[{"given":"Patricia","family":"Dom\u00ednguez-Mar\u00edn","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2043_CR1","first-page":"65","volume-title":"Proceedings of CompEuro, Vol. 92","author":"J. Alander","year":"1992","unstructured":"Alander, J. (1992). \u201cOn Optimal Population Size of Genetic Algorithms.\u201d In Proceedings of CompEuro, Vol. 92, IEEE Computer Society Press, Silverspring, MD, pp. 65\u201370."},{"key":"2043_CR2","unstructured":"B\u00e4ck, T., F. Hoffmeister, and H. Schwefel. (1991). \u201cA Survey of Evolution Strategies.\u201d In R. Belew and L. Booker (eds.), Genetic Algorithms, Proceedings of the Fourth International Conference, Morgan Kaufmann, San Mateo, CA, pp. 2\u20139."},{"key":"2043_CR3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J. Beasley","year":"1985","unstructured":"Beasley, J. (1985). \u201cSolving Large p-Median Problems.\u201d European Journal of Operational Research 21, 270\u2013273.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2043_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley, J. (1990). \u201cOR-Library: Distributing Test Problems by Electronic Mail.\u201d Journal of the Operational Research Society 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"2043_CR5","unstructured":"Boland, N., P. Dom\u00ednguez-Mar\u00edn, S. Nickel, and J. Puerto. (2003). \u201cExact Procedures for Solving the Discrete Ordered Median Problem.\u201d ITWM Bericht 47, Fraunhofer Institut f\u00fcr Techno\u2013 und Wirtschaftsmathematik (ITWM), Kaiserslautern, Germany."},{"key":"2043_CR6","unstructured":"Booker, L. (1987). Genetic Algorithms and Simulated Annealing, Chapt. Improving Search in Genetic Algorithms, Morgan Kauffmann, pp. 61\u201373."},{"key":"2043_CR7","unstructured":"Bozkaya, B., J. Zhang, and E. Erkut. (2002). Chapt. An Efficient Genetic Algoithm for the p-Median Problem, Springer, pp. 179\u2013205."},{"key":"2043_CR8","doi-asserted-by":"crossref","unstructured":"Daskin, M. (1995). Network and Discrete Location: Models, Algorithms, and Applications. Wiley.","DOI":"10.1002\/9781118032343"},{"key":"2043_CR9","volume-title":"Genetic Algorithms and Simulated Annealing","year":"1987","unstructured":"Davis, L. (ed.). (1987). Genetic Algorithms and Simulated Annealing. Morgan Kaufmann Publishers, San Mateo, CA."},{"key":"2043_CR10","volume-title":"Handbook of Genetic Algorithms","year":"1991","unstructured":"Davis, L. (ed.). (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York."},{"key":"2043_CR11","unstructured":"Dawkins, R. (1989). The Selfish Gene. Oxford University Press, second edition."},{"key":"2043_CR12","volume-title":"Facility Location: Applications and Theory","year":"2002","unstructured":"Drezner, Z. and H. Hamacher. (eds.). (2002). Facility Location: Applications and Theory. Springer Berlin Heidelberg New York."},{"issue":"1","key":"2043_CR13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S. Elloumi","year":"2004","unstructured":"Elloumi, S., M. Labb\u00e9, and Y. Pochet. (2004). \u201cA New Formulation and Resolution Method for the p-Center Problem.\u201d INFORMS Journal on Computing 16(1), 84\u201394.","journal-title":"INFORMS Journal on Computing"},{"key":"2043_CR14","unstructured":"Fairly, A. (1991). Comparison of Methods of Choosing the Crossover Point in the Genetic Crossover Operation. Department of Computer Science, University of Liverpool."},{"key":"2043_CR15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/opre.48.2.294.12382","volume":"48","author":"R. Francis","year":"2000","unstructured":"Francis, R., T. Lowe, and A. Tamir. (2000). \u201cAggregation Error Bounds for a Class of Location Models.\u201d Operations Research 48, 294\u2013307.","journal-title":"Operations Research"},{"key":"2043_CR16","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, MA."},{"key":"2043_CR17","unstructured":"Hansen, P. and N. Maldenovi\u0107. (2001). \u201cDevelopments of Variable Neighborhood Search.\u201d In C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 415\u2013439."},{"key":"2043_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., N. Maldenovi\u0107, and D. P\u00e9rez-Brito. (2001). \u201cVariable Neighborhood Decomposition Search.\u201d Journal of Heuristics 7, 335\u2013350.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"2043_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P. and N. Mladenovi\u0107. (1997). \u201cVariable Neighborhood Search for the p-Median.\u201d Location Science 5(4), 207\u2013226.","journal-title":"Location Science"},{"key":"2043_CR20","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2001a). \u201cVariable Neighborhood Search.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. A preliminary version is available at http:\/\/smg.ulb.ac.be\/Preprints\/Hansen01_02.html."},{"issue":"3","key":"2043_CR21","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001b","unstructured":"Hansen, P. and N. Mladenovi\u0107. (2001b). \u201cVariable Neighborhood Search: Principles and Applications.\u201d European Journal of Operations Research 130(3), 449\u2013467.","journal-title":"European Journal of Operations Research"},{"key":"2043_CR22","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor."},{"key":"2043_CR23","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02027381","volume":"6","author":"C. Hosage","year":"1986","unstructured":"Hosage, C. and M. Goodchild. (1986). \u201cDiscrete Space Location-Allocation Solutions form Genetic Algorithms.\u201d Annals of Operations Research 6, 35\u201346.","journal-title":"Annals of Operations Research"},{"key":"2043_CR24","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"J. Jaramillo","year":"2002","unstructured":"Jaramillo, J., J. Bhadury, and R. Batta. (2002). \u201cOn the Use of Genetic Algorithms to Solve Location Problems.\u201d Computers and Operations Research 29, 761\u2013779.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2043_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.10053","volume":"41","author":"J. Kalcsics","year":"2003","unstructured":"Kalcsics, J., S. Nickel, and J. Puerto. (2003). \u201cMultifacility Ordered Median Problems on Networks: A Further Analysis.\u201d Networks 41(1), 1\u201312.","journal-title":"Networks"},{"key":"2043_CR26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(02)00121-9","volume":"30","author":"J. Kalcsics","year":"2002","unstructured":"Kalcsics, J., S. Nickel, J. Puerto, and A. Tamir. (2002). \u201cAlgorithmic Results for Ordered Median Problems Defined on Networks and the Plane.\u201d Operations Research Letters 30, 149\u2013158.","journal-title":"Operations Research Letters"},{"key":"2043_CR27","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O. and S. Hakimi. (1979). \u201cAn Algorithmic Approach to Network Location Problems. II: The p-Medians.\u201d SIAM Journal on Applied Mathematics 37, 539\u2013560.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2043_CR28","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, third edition.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"2043_CR29","volume-title":"Discrete Location Theory","author":"P. Mirchandani","year":"1990","unstructured":"Mirchandani, P. and R. Francis. (1990). Discrete Location Theory. Wiley, New York, NY."},{"key":"2043_CR30","unstructured":"Mladenovi\u0107, N. (1995). \u201cA Variable Neighborhood Algorithm\u2014A New Metaheuristic for Combinatorial Optimization.\u201d Abstracts of papers presented at Optimization Days, Montr\u00e9al, p. 112."},{"key":"2043_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N. and P. Hansen. (1997). \u201cVariable Neighbourhood Search.\u201d Computers and Operations Research 24, 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"2043_CR32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"N. Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., M. Labb\u00e9, and P. Hansen. (2003). \u201cSolving the p-Center Problem by Tabu Search and Variable Neighborhood Search.\u201d Networks 42, 48\u201364.","journal-title":"Networks"},{"key":"2043_CR33","first-page":"131","volume":"7","author":"J. Moreno P\u00e9rez","year":"1994","unstructured":"Moreno P\u00e9rez, J., J. Roda Garc\u00eda, and J. Moreno Vega. (1994). \u201cA Parallel Genetic Algorithm for the Discrete p-Median Problem.\u201d In Studies in Locational Analysis, Vol. 7, pp. 131\u2013141.","journal-title":"Studies in Locational Analysis"},{"key":"2043_CR34","unstructured":"Moreno Vega, J. (1996). \u201cMetaheur\u00edsticas en Localizaci\u00f3n: An\u00e1lisis Te\u00f3rico y Experimental.\u201d Ph.D. thesis, University of La Laguna. (In Spanish)."},{"key":"2043_CR35","doi-asserted-by":"crossref","unstructured":"Nickel, S. (2001). \u201cDiscrete Ordered Weber Problems.\u201d In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder (eds.), Operations Research Proceedings 2000, Springer, pp. 71\u201376.","DOI":"10.1007\/978-3-642-56656-1_12"},{"key":"2043_CR36","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2","volume":"34","author":"S. Nickel","year":"1999","unstructured":"Nickel, S. and J. Puerto. (1999). \u201cA Unified Approach to Network Location Problems.\u201d Networks 34, 283\u2013290.","journal-title":"Networks"},{"key":"2043_CR37","unstructured":"Ogryczak, W. (1994). \u201cOn the Lexicographic Minimax Approach to Location-Allocation Problems.\u201d Technical Report."},{"key":"2043_CR38","unstructured":"Puerto, J. and F. Fern\u00e1ndez. (1995). \u201cThe Symmetrical Single Facility Location Problem.\u201d Technical Report, Faculty of Mathematics, University of Sevilla."},{"issue":"3","key":"2043_CR39","first-page":"321","volume":"1","author":"J. Puerto","year":"2000","unstructured":"Puerto, J. and F. Fern\u00e1ndez. (2000). \u201cGeometrical Properties of the Symmetrical Single Facility Location Problem.\u201d Journal of Nonlinear and Convex Analysis 1(3), 321\u2013342.","journal-title":"Journal of Nonlinear and Convex Analysis"},{"key":"2043_CR40","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s001860050003","volume":"51","author":"A. Rodr\u00edguez-Ch\u00eda","year":"2000","unstructured":"Rodr\u00edguez-Ch\u00eda, A., S. Nickel, J. Puerto, and F. Fern\u00e1ndez. (2000). \u201cA Flexible Approach to Location Problems.\u201d Mathematical Methods of Operations Research 51, 69\u201389.","journal-title":"Mathematical Methods of Operations Research"},{"key":"2043_CR41","volume-title":"Numerical Optimization of Computer Models","author":"H. Schwefel","year":"1981","unstructured":"Schwefel, H. (1981). Numerical Optimization of Computer Models. Wiley, Chichester."},{"key":"2043_CR42","first-page":"95","volume":"21","author":"R. Whitaker","year":"1983","unstructured":"Whitaker, R. (1983). \u201cA Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems.\u201d INFOR 21, 95\u2013108.","journal-title":"INFOR"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2043-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2043-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2043-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:33Z","timestamp":1559152773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2043-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["2043"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2043-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}