{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:56Z","timestamp":1740123296989,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003286","name":"Kuwait Foundation for the Advancement of Sciences","doi-asserted-by":"publisher","award":["P115-18EO-02"],"award-info":[{"award-number":["P115-18EO-02"]}],"id":[{"id":"10.13039\/501100003286","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10479-022-04708-1","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T05:02:40Z","timestamp":1651554160000},"page":"57-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptation of WO to the Euclidean location-allocation with unknown number of facilities"],"prefix":"10.1007","volume":"315","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1590-4494","authenticated-orcid":false,"given":"Jean-Paul","family":"Arnaout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Khoury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"key":"4708_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1057\/palgrave.jors.2602262","volume":"59","author":"N Aras","year":"2008","unstructured":"Aras, N., Orbay, M., & Altinel, I. K. (2008). Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. Journal of the Operational Research Society, 59, 64\u201379.","journal-title":"Journal of the Operational Research Society"},{"key":"4708_CR2","unstructured":"Arnaout, J. P. (2018). Worm optimisation algorithm to minimise the makespan for the two-machine scheduling problem with a single server. International Journal of Operational Research, In Press."},{"key":"4708_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10845-011-0536-2","volume":"24","author":"J-P Arnaout","year":"2013","unstructured":"Arnaout, J.-P. (2013). Ant Colony Optimization algorithm for the Euclidean location-allocation problem with unknown number of facilities. Journal of Intelligent Manufacturing, 24, 45\u201354.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"4708_CR4","volume-title":"Heuristics, meta-heuristics and approximate methods in planning and scheduling, international series in operations research & management science","author":"J-P Arnaout","year":"2016","unstructured":"Arnaout, J.-P. (2016). Worm optimization for the traveling salesman problem. In G. Rabadi (Ed.), Heuristics, meta-heuristics and approximate methods in planning and scheduling, international series in operations research & management science. Springer International Publishing."},{"key":"4708_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-017-0334-5","author":"J-P Arnaout","year":"2017","unstructured":"Arnaout, J.-P. (2017). Worm optimization for the multiple level warehouse layout problem. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s12351-017-0334-5","journal-title":"Annals of Operations Research"},{"key":"4708_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-019-03138-w","volume":"285","author":"J-P Arnaout","year":"2020","unstructured":"Arnaout, J.-P. (2020). A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Annals of Operations Research, 285, 273\u2013293.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"4708_CR7","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.3934\/jimo.2016.12.1215","volume":"12","author":"J-P Arnaout","year":"2016","unstructured":"Arnaout, J.-P., Arnaout, G., & Khoury, J. (2016). Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem. Journal of Industrial and Management Optimization, 12(4), 1215\u20131225.","journal-title":"Journal of Industrial and Management Optimization"},{"key":"4708_CR8","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1016\/j.cor.2008.02.014","volume":"36","author":"M Bischoff","year":"2009","unstructured":"Bischoff, M., Fleischmann, T., & Klamroth, K. (2009). The multi-facility location-allocation problem with polyhedral barriers. Computers and Operations Research, 36, 1376\u20131392.","journal-title":"Computers and Operations Research"},{"key":"4708_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2005.10.061","volume":"177","author":"M Bischoff","year":"2007","unstructured":"Bischoff, M., & Klamroth, K. (2007). An efficient solution method for Weber problems with barriers based on genetic algorithms. European Journal of Operational Research, 177, 22\u201341.","journal-title":"European Journal of Operational Research"},{"key":"4708_CR10","doi-asserted-by":"crossref","unstructured":"Brabazon, A., & McGarraghy, S. (Eds.). (2018). Worm foraging algorithm. In Foraging-inspired optimisation algorithms. Natural computing series. Springer.","DOI":"10.1007\/978-3-319-59156-8"},{"key":"4708_CR11","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., & Taillard, E. (2000). Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Operations Research, 48, 444\u2013460.","journal-title":"Operations Research"},{"issue":"6","key":"4708_CR12","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1057\/palgrave.jors.2601754","volume":"55","author":"J Brimberg","year":"2004","unstructured":"Brimberg, J., Mladenovic, N., & Salhi, S. (2004). The multi-source weber problem with constant opening cost. Journal of the Operational Research Society, 55(6), 640\u2013646.","journal-title":"Journal of the Operational Research Society"},{"key":"4708_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.cie.2017.08.003","volume":"112","author":"H Carlo","year":"2017","unstructured":"Carlo, H., David, V., & Salvat-D\u00e1vila, G. (2017). Transportation-location problem with unknown number of facilities. Computers & Industrial Engineering, 112, 212\u2013220.","journal-title":"Computers & Industrial Engineering"},{"key":"4708_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper, L. (1963). Location\u2013allocation problems. Operations Research, 11, 331\u2013343.","journal-title":"Operations Research"},{"issue":"1\u20132","key":"4708_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-014-1699-y","volume":"246","author":"T Drezner","year":"2016","unstructured":"Drezner, T., & Drezner, Z. (2016). Sequential location of two facilities: Comparing random to optimal location of the first facility. Annals of Operations Research, 246(1\u20132), 5\u201318.","journal-title":"Annals of Operations Research"},{"key":"4708_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-015-1797-5","volume":"246","author":"Z Drezner","year":"2016","unstructured":"Drezner, Z., Brimberg, J., Salhi, S., & Mladenovic, N. (2016). New local searches for solving the multi-source Weber problem. Annals of Operations Research, 246, 181\u2013203.","journal-title":"Annals of Operations Research"},{"key":"4708_CR17","volume-title":"Distribution management, mathematical modelling and practical analysis","author":"S Eilon","year":"1971","unstructured":"Eilon, S., Watson-Gandy, C. D. T., & Christofides, N. (1971). Distribution management, mathematical modelling and practical analysis. Hofner."},{"key":"4708_CR18","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1057\/palgrave.jors.2601176","volume":"52","author":"MDH Gamal","year":"2001","unstructured":"Gamal, M. D. H., & Salhi, S. (2001). Constructive heuristics for the uncapacitated location-allocation problem. Journal of the Operational Research Society, 52, 821\u2013829.","journal-title":"Journal of the Operational Research Society"},{"key":"4708_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","volume":"23","author":"CR Houck","year":"1996","unstructured":"Houck, C. R., Joines, J. A., & Kay, M. G. (1996). Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers and Operations Research, 23, 587\u2013596.","journal-title":"Computers and Operations Research"},{"key":"4708_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00170-007-0944-9","volume":"37","author":"M Jabalameli","year":"2008","unstructured":"Jabalameli, M., & Ghaderi, A. (2008). Hybrid algorithms for the uncapacitated continuous location-allocation problem. International Journal of Advanced Manufacturing Technology, 37, 202\u2013209.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"4708_CR21","unstructured":"Krau S. (1997). Extensions du probl\u00e8me de Weber. PhD Th\u00e8se, Ecole Polytechnique de Montreal."},{"key":"4708_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584989","volume":"3","author":"R Kuenne","year":"1972","unstructured":"Kuenne, R., & Soland, R. M. (1972). Exact and approximate solutions to the multisource Weber problem. Mathematical Programming, 3, 193\u2013209.","journal-title":"Mathematical Programming"},{"key":"4708_CR23","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10845-009-0297-3","volume":"22","author":"Q Liu","year":"2009","unstructured":"Liu, Q., & Xu, J. (2009). A study on facility location\u2013allocation problem in mixed environment of randomness and fuzziness. Journal of Intelligent Manufacturing, 2011, 389\u2013398.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"4708_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13, 182\u2013196.","journal-title":"SIAM Journal on Computing"},{"key":"4708_CR25","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1057\/palgrave.jors.2600409","volume":"48","author":"M Ohlemuller","year":"1997","unstructured":"Ohlemuller, M. (1997). Tabu search for large location-allocation problems. Journal of the Operational Research Society, 48, 745\u2013750.","journal-title":"Journal of the Operational Research Society"},{"key":"4708_CR26","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s10845-010-0416-1","volume":"23","author":"S Pasandideh","year":"2010","unstructured":"Pasandideh, S., & Niaki, S. (2010). Genetic application in a facility location problem with random demand within queuing framework. Journal of Intelligent Manufacturing, 2012, 651\u2013659.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"4708_CR27","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSLIB-a traveling salesman library. ORSA Journal of Computing, 3, 376\u2013384.","journal-title":"ORSA Journal of Computing"},{"key":"4708_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1026131531250","volume":"123","author":"S Salhi","year":"2003","unstructured":"Salhi, S., & Gamal, M. D. H. (2003). A genetic algorithm based approach for the uncapacitated continuous location-allocation problem. Annals of Operations Research, 123, 203\u2013222.","journal-title":"Annals of Operations Research"},{"key":"4708_CR29","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld, E. (1937). Sur le point par lequel la somme des distances de n Points donn\u00e9s est minimum. Tohoku Mathematical Journal, 43, 355\u2013386.","journal-title":"Tohoku Mathematical Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04708-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04708-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04708-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T15:37:47Z","timestamp":1659022667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04708-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4708"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04708-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"5 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}