{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T16:04:26Z","timestamp":1769443466562,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["215M143"],"award-info":[{"award-number":["215M143"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00521-022-08010-w","type":"journal-article","created":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T07:03:07Z","timestamp":1668841387000},"page":"6313-6330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A genetic algorithm integrated with the initial solution procedure and parameter tuning for capacitated P-median problem"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5791-3845","authenticated-orcid":false,"given":"Mehmet Kursat","family":"Oksuz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6321-0302","authenticated-orcid":false,"given":"Kadir","family":"Buyukozkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0675-0796","authenticated-orcid":false,"given":"Alperen","family":"Bal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2768-4038","authenticated-orcid":false,"given":"Sule Itir","family":"Satoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"issue":"1","key":"8010_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.asoc.2007.12.007","volume":"9","author":"C Cruz","year":"2009","unstructured":"Cruz C, Pelta D (2009) Soft computing and cooperative strategies for optimization. Appl Soft Comput 9(1):30\u201338","journal-title":"Appl Soft Comput"},{"issue":"3","key":"8010_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48(3):125\u2013142","journal-title":"Networks"},{"key":"8010_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.asoc.2016.02.002","volume":"42","author":"A Djeni\u0107","year":"2016","unstructured":"Djeni\u0107 A, Radoji\u010di\u0107 N, Mari\u0107 M, Mladenovi\u0107 M (2016) Parallel VNS for bus terminal location problem. Appl Soft Comput 42:448\u2013458","journal-title":"Appl Soft Comput"},{"key":"8010_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.asoc.2014.09.041","volume":"27","author":"YJ Zheng","year":"2015","unstructured":"Zheng YJ, Chen SY, Ling HF (2015) Evolutionary optimization for disaster relief operations: a survey. Appl Soft Comput 27:553\u2013566","journal-title":"Appl Soft Comput"},{"issue":"2","key":"8010_CR5","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.ijpe.2005.12.003","volume":"103","author":"SI Satoglu","year":"2006","unstructured":"Satoglu SI, Durmusoglu MB, Dogan I (2006) Evaluation of the conversion from central storage to decentralized storages in cellular manufacturing environments using activity-based costing. Int J Prod Econ 103(2):616\u2013632","journal-title":"Int J Prod Econ"},{"issue":"3","key":"8010_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II: The p-medians. SIAM J Appl Math 37(3):539\u2013560","journal-title":"SIAM J Appl Math"},{"issue":"3","key":"8010_CR7","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, Moreno-P\u00e9rez JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3):927\u2013939","journal-title":"Eur J Oper Res"},{"key":"8010_CR8","doi-asserted-by":"crossref","unstructured":"Osaba E, Carballedo R, Diaz F, Onieva E, Lopez P, Perallos A (2014a) On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: a first study on the TSP. In: IEEE conference on evolving and adaptive intelligent systems (EAIS) (pp 1\u20136). IEEE","DOI":"10.1109\/EAIS.2014.6867465"},{"key":"8010_CR9","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ins.2016.08.066","volume":"372","author":"N Ve\u010dek","year":"2016","unstructured":"Ve\u010dek N, Mernik M, Filipi\u010d B, \u010crepin\u0161ek M (2016) Parameter tuning with chess rating system (CRS-Tuning) for meta-heuristic algorithms. Inf Sci 372:446\u2013469","journal-title":"Inf Sci"},{"issue":"4","key":"8010_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1023\/A:1027353520175","volume":"3","author":"LAN Lorena","year":"2003","unstructured":"Lorena LAN, Senne ELF (2003) Local search heuristics for capacitated p-median problems. Netw Spat Econ 3(4):407\u2013419","journal-title":"Netw Spat Econ"},{"issue":"1","key":"8010_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1111\/itor.12103","volume":"22","author":"F Stefanello","year":"2015","unstructured":"Stefanello F, de Ara\u00fajo OC, M\u00fcller FM (2015) Matheuristics for the capacitated p-median problem. Int Trans Oper Res 22(1):149\u2013167","journal-title":"Int Trans Oper Res"},{"key":"8010_CR12","first-page":"177","volume-title":"Zanjirani Farahani, Reza","author":"M Jamshidi","year":"2009","unstructured":"Jamshidi M (2009) Median location problem. In: Hekmatfar M (ed) Zanjirani Farahani, Reza. Physica-Verlag, Facility Location, pp 177\u2013191"},{"key":"8010_CR13","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1007\/s11590-021-01848-4","volume":"16","author":"R Baldacci","year":"2022","unstructured":"Baldacci R, Caserta M, Traversi E, Wolfler Calvo R (2022) Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim Lett 16:2711\u20132727","journal-title":"Optim Lett"},{"key":"8010_CR14","doi-asserted-by":"publisher","first-page":"100069","DOI":"10.1016\/j.ejtl.2021.100069","volume":"11","author":"J Ryu","year":"2022","unstructured":"Ryu J, Park S (2022) A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty. EURO J Trans Logistics 11:100069","journal-title":"EURO J Trans Logistics"},{"issue":"6","key":"8010_CR15","doi-asserted-by":"publisher","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(6):863\u2013876","journal-title":"Comput Oper Res"},{"issue":"4","key":"8010_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0548(00)00072-1","volume":"29","author":"R Baldacci","year":"2002","unstructured":"Baldacci R, Hadjiconstantinou E, Maniezzo V, Mingozzi A (2002) A new method for solving capacitated location problems based on a set partitioning approach. Comput Oper Res 29(4):365\u2013386","journal-title":"Comput Oper Res"},{"issue":"4","key":"8010_CR17","first-page":"319","volume":"1","author":"A Ceselli","year":"2003","unstructured":"Ceselli A (2003) Two exact algorithms for the capacitated p-median problem. Q J Belg Fr Ital Oper Res Soc 1(4):319\u2013340","journal-title":"Q J Belg Fr Ital Oper Res Soc"},{"key":"8010_CR18","doi-asserted-by":"publisher","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"},{"issue":"3","key":"8010_CR19","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.03.078","volume":"179","author":"A Klose","year":"2007","unstructured":"Klose A, G\u00f6rtz S (2007) A branch-and-price algorithm for the capacitated facility location problem. Eur J Oper Res 179(3):1109\u20131125","journal-title":"Eur J Oper Res"},{"issue":"1","key":"8010_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10852-007-9074-5","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 Modell Algorithms 7(1):43\u201358","journal-title":"J Math Modell Algorithms"},{"key":"8010_CR21","doi-asserted-by":"crossref","unstructured":"Avella P, Boccia M, Mattia S (2013) A branch-and-cut algorithm for the single-source capacitated facility location problem. In: Advanced logistics and transport (ICALT), 2013 international conference on (pp 181\u2013186). IEEE","DOI":"10.1109\/ICAdLT.2013.6568456"},{"issue":"3","key":"8010_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1009665717611","volume":"4","author":"V Maniezzo","year":"1998","unstructured":"Maniezzo V, Mingozzi A, Baldacci R (1998) A bionomic approach to the capacitated p-medianproblem. J Heuristics 4(3):263\u2013280","journal-title":"J Heuristics"},{"issue":"1","key":"8010_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ejor.2003.08.066","volume":"162","author":"S Ahmadi","year":"2005","unstructured":"Ahmadi S, Osman IH (2005) Greedy random adaptive memory programming search for the capacitated clustering problem. Eur J Oper Res 162(1):30\u201344","journal-title":"Eur J Oper Res"},{"issue":"2","key":"8010_CR24","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ejor.2004.08.016","volume":"169","author":"JA Diaz","year":"2006","unstructured":"Diaz JA, Fernandez E (2006) Hybrid scatter search and path relinking for the capacitated p-median problem. Eur J Oper Res 169(2):570\u2013585","journal-title":"Eur J Oper Res"},{"issue":"2","key":"8010_CR25","doi-asserted-by":"publisher","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(2):533\u2013547","journal-title":"Eur J Oper Res"},{"issue":"3","key":"8010_CR26","doi-asserted-by":"publisher","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(3):612\u2013622","journal-title":"Eur J Oper Res"},{"issue":"8","key":"8010_CR27","first-page":"305","volume":"19","author":"H Shamsipoor","year":"2012","unstructured":"Shamsipoor H, Sandidzadeh MA, Yaghini M (2012) Solving capacitated p-median problem by a new structure of neural network. Int J Ind EngTheory Appl Pract 19(8):305\u2013319","journal-title":"Int J Ind EngTheory Appl Pract"},{"issue":"4","key":"8010_CR28","first-page":"412","volume":"22","author":"JD Hong","year":"2015","unstructured":"Hong JD, Jeong KY, Xie Y (2015) A multi-objective approach to planning in emergency logistics network design. Int J Indus Eng Eng Theory Appl Practice 22(4):412\u2013425","journal-title":"Int J Indus Eng Eng Theory Appl Practice"},{"key":"8010_CR29","doi-asserted-by":"publisher","first-page":"105304","DOI":"10.1016\/j.cor.2021.105304","volume":"132","author":"M Gn\u00e4gi","year":"2021","unstructured":"Gn\u00e4gi M, Baumann P (2021) A matheuristic for large-scale capacitated clustering. Comput Oper Res 132:105304","journal-title":"Comput Oper Res"},{"issue":"3","key":"8010_CR30","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"IH Osman","year":"1994","unstructured":"Osman IH, Christofides N (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. Int Trans Oper Res 1(3):317\u2013336","journal-title":"Int Trans Oper Res"},{"key":"8010_CR31","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-74972-1_19","volume-title":"Innovations in hybrid intelligent systems, Corchado","author":"AA Chaves","year":"2007","unstructured":"Chaves AA, de Assis Correa F, Lorena LAN (2007) Clustering search heuristic for the capacitated p-median problem. In: Emilio CR, Manuel J, Abraham A (eds) Innovations in hybrid intelligent systems, Corchado. Springer, Berlin Heidelberg, pp 136\u2013143"},{"issue":"9","key":"8010_CR32","doi-asserted-by":"publisher","first-page":"2214","DOI":"10.1016\/j.cor.2011.11.004","volume":"39","author":"I Landa-Torres","year":"2012","unstructured":"Landa-Torres I, Del Ser J, Salcedo-Sanz S, Gil-Lopez S, Portilla-Figueras JA, Alonso-Garrido O (2012) A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem. Comput Oper Res 39(9):2214\u20132222","journal-title":"Comput Oper Res"},{"issue":"9","key":"8010_CR33","doi-asserted-by":"publisher","first-page":"3922","DOI":"10.1016\/j.asoc.2013.04.009","volume":"13","author":"M Yaghini","year":"2013","unstructured":"Yaghini M, Karimi M, Rahbar M (2013) A hybrid metaheuristic approach for the capacitated p-median problem. Appl Soft Comput 13(9):3922\u20133930","journal-title":"Appl Soft Comput"},{"issue":"1\u20134","key":"8010_CR34","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp O, Erkut E, Drezner Z (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122(1\u20134):21\u201342","journal-title":"Ann Oper Res"},{"key":"8010_CR35","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-56082-8_6","volume-title":"Facility location: applications and theory","author":"B Bozkaya","year":"2002","unstructured":"Bozkaya B, Zhang J, Erkut E (2002) An efficient genetic algorithm for the p-median problem. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer Verlag, Berlin, New York, pp 179\u2013205"},{"issue":"2","key":"8010_CR36","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.amc.2006.05.143","volume":"183","author":"J Fathali","year":"2006","unstructured":"Fathali J (2006) A genetic algorithm for the p-median problem with pos\/neg weights. Appl Math Comput 183(2):1071\u20131083","journal-title":"Appl Math Comput"},{"key":"8010_CR37","unstructured":"Oksuz MK, Satoglu SI, Kayakutlu G, Buyukozkan K (2016) A genetic algorithm for p-median facility location problem. In: Global joint conference on industrial engineering and its application areas (GCJIE 2016), Istanbul, Turkey, July 14\u201315"},{"issue":"2\u20134","key":"8010_CR38","doi-asserted-by":"publisher","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(2\u20134):373\u2013388","journal-title":"Numer Algorithms"},{"key":"8010_CR39","doi-asserted-by":"crossref","unstructured":"Ghoseiri K, Ghannadpour SF (2007) Solving a capacitated p-median problem using genetic algorithm. In: IEEE international conference on industrial engineering and engineering management, (pp 885\u2013889). IEEE","DOI":"10.1109\/IEEM.2007.4419318"},{"key":"8010_CR40","doi-asserted-by":"publisher","first-page":"107584","DOI":"10.1016\/j.cie.2021.107584","volume":"160","author":"K Yang","year":"2021","unstructured":"Yang K, Wang R, He H, Yang X, Zhang G (2021) Multi-supply multi-capacitated p-median location optimization via a hybrid bi-level intelligent algorithm. Comput Ind Eng 160:107584","journal-title":"Comput Ind Eng"},{"key":"8010_CR41","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10479-021-04244-4","volume":"309","author":"A Taghavi","year":"2022","unstructured":"Taghavi A, Ghanbari R, Ghorbani-Moghadam K, Davoodi A, Emrouznejad A (2022) A genetic algorithm for solving bus terminal location problem using data envelopment analysis with multi-objective programming. Ann Oper Res 309:259\u2013276","journal-title":"Ann Oper Res"},{"issue":"1","key":"8010_CR42","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00521-013-1448-1","volume":"25","author":"D Liu","year":"2014","unstructured":"Liu D (2014) Network site optimization of reverse logistics for E-commerce based on genetic algorithm. Neural Comput Appl 25(1):67\u201371","journal-title":"Neural Comput Appl"},{"issue":"6","key":"8010_CR43","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1007\/s00521-019-04257-y","volume":"32","author":"K Guo","year":"2020","unstructured":"Guo K (2020) Research on location selection model of distribution network with constrained line constraints based on genetic algorithm. Neural Comput Appl 32(6):1679\u20131689","journal-title":"Neural Comput Appl"},{"issue":"1","key":"8010_CR44","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00521-018-3730-8","volume":"31","author":"J Liu","year":"2019","unstructured":"Liu J, Xiao Y, Wang D, Pang Y (2019) Optimization of site selection for construction and demolition waste recycling plant using genetic algorithm. Neural Comput Appl 31(1):233\u2013245","journal-title":"Neural Comput Appl"},{"key":"8010_CR45","first-page":"1","volume":"2014","author":"E Osaba","year":"2014","unstructured":"Osaba E, Carballedo R, Diaz F, Onieva E, De La Iglesia I, Perallos A (2014) Crossover versus mutation: a comparative analysis of the evolutionary strategy of genetic algorithms applied to combinatorial optimization problems. Sci World J 2014:1\u201322","journal-title":"Sci World J"},{"key":"8010_CR46","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","volume":"32","author":"PV Paul","year":"2015","unstructured":"Paul PV, Moganarangan N, Kumar SS, Raju R, Vengattaraman T, Dhavachelvan P (2015) Performance analyses overpopulation seeding techniques of the permutation-coded genetic algorithm: an empirical study based on traveling salesman problems. Appl Soft Comput 32:383\u2013402","journal-title":"Appl Soft Comput"},{"key":"8010_CR47","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.compbiomed.2016.03.020","volume":"72","author":"D Ravichandran","year":"2016","unstructured":"Ravichandran D, Praveenkumar P, Rayappan JBB, Amirtharajan R (2016) Chaos-based crossover and mutation for securing DICOM image. Comput Biol Med 72:170\u2013184","journal-title":"Comput Biol Med"},{"key":"8010_CR48","doi-asserted-by":"crossref","unstructured":"Doerr B, Le HP, Makhmara R, Nguyen, TD (2017) Fast genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference (pp 777\u2013784). ACM","DOI":"10.1145\/3071178.3071301"},{"issue":"4","key":"8010_CR49","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1016\/j.asoc.2007.10.021","volume":"8","author":"S Salcedo-Sanz","year":"2008","unstructured":"Salcedo-Sanz S, Portilla-Figueras JA, Ortiz-Garc\u00eda EG, P\u00e9rez-Bellido AM, Thraves C, Fern\u00e1ndez-Anta A, Yao X (2008) Optimal switch location in mobile communication networks using hybrid genetic algorithms. Appl Soft Comput 8(4):1486\u20131497","journal-title":"Appl Soft Comput"},{"issue":"5","key":"8010_CR50","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80(5):8091\u20138126","journal-title":"Multimed Tools Appl"},{"key":"8010_CR51","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1007\/s00453-020-00743-1","volume":"82","author":"D Corus","year":"2020","unstructured":"Corus D, Oliveto PS (2020) On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica 82:3676\u20133706","journal-title":"Algorithmica"},{"key":"8010_CR52","volume-title":"Genetic algorithms","author":"C Reeves","year":"2003","unstructured":"Reeves C (2003) Genetic algorithms. Springer, USA"},{"issue":"3","key":"8010_CR53","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"JM Mulvey","year":"1984","unstructured":"Mulvey JM, Beck MP (1984) Solving capacitated clustering problems. Eur J Oper Res 18(3):339\u2013348","journal-title":"Eur J Oper Res"},{"issue":"1","key":"8010_CR54","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54(1):99\u2013114","journal-title":"Oper Res"},{"key":"8010_CR55","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.eswa.2015.12.018","volume":"50","author":"K Buyukozkan","year":"2016","unstructured":"Buyukozkan K, Kucukkoc I, Satoglu SI, Zhang DZ (2016) Lexicographic bottleneck mixed-model assembly line balancing problem: artificial bee colony and tabu search approaches with optimized parameters. Expert Syst Appl 50:151\u2013166","journal-title":"Expert Syst Appl"},{"key":"8010_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/3001478","volume":"11","author":"DB Duncan","year":"1955","unstructured":"Duncan DB (1955) Multiple ranges and multiple F tests. Biometrics 11:1\u201342","journal-title":"Biometrics"},{"issue":"2","key":"8010_CR57","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/3001913","volume":"5","author":"J Tukey","year":"1949","unstructured":"Tukey J (1949) Comparing individual means in the analysis of variance. Biometrics 5(2):99\u2013114","journal-title":"Biometrics"},{"key":"8010_CR58","unstructured":"Url-1. http:\/\/www.lac.inpe.br\/~lorena\/instancias.html. Last access date: June 1st, 2021"},{"key":"8010_CR59","unstructured":"Url-2. http:\/\/www-usr.inf.ufsm.br\/~stefanello\/instances\/CPMP\/group2\/. Last access date: July 12st, 2021"}],"updated-by":[{"DOI":"10.1007\/s00521-023-08564-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T00:00:00Z","timestamp":1681257600000}}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08010-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-08010-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08010-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T19:03:39Z","timestamp":1681326219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-08010-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,19]]},"references-count":59,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["8010"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-08010-w","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00521-023-08564-3","asserted-by":"object"}]},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,19]]},"assertion":[{"value":"6 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00521-023-08564-3","URL":"https:\/\/doi.org\/10.1007\/s00521-023-08564-3","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}