{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:59:21Z","timestamp":1772776761200,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s00500-022-06837-y","type":"journal-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T14:04:31Z","timestamp":1645538671000},"page":"4333-4361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A new modified social engineering optimizer algorithm for engineering applications"],"prefix":"10.1007","volume":"26","author":[{"given":"Fariba","family":"Goodarzian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiman","family":"Ghasemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikas","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"6837_CR1","doi-asserted-by":"publisher","first-page":"107113","DOI":"10.1016\/j.asoc.2021.107113","volume":"102","author":"BH Abed-Alguni","year":"2021","unstructured":"Abed-Alguni BH, Alawad NA (2021) Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments. Appl Soft Comput 102:107113","journal-title":"Appl Soft Comput"},{"issue":"15","key":"6837_CR2","doi-asserted-by":"publisher","first-page":"10167","DOI":"10.1007\/s00500-021-05939-3","volume":"25","author":"BH Abed-Alguni","year":"2021","unstructured":"Abed-Alguni BH, Alawad NA, Barhoush M, Hammad R (2021) Exploratory cuckoo search for solving single-objective optimization problems. Soft Comput 25(15):10167\u201310180","journal-title":"Soft Comput"},{"issue":"8","key":"6837_CR3","doi-asserted-by":"publisher","first-page":"3635","DOI":"10.1007\/s13369-017-2663-3","volume":"42","author":"BH Abed-Alguni","year":"2017","unstructured":"Abed-Alguni BH, Alkhateeb F (2017) Novel selection schemes for cuckoo search. Arab J Sci Eng 42(8):3635\u20133654","journal-title":"Arab J Sci Eng"},{"key":"6837_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-10674-4","volume-title":"Feature selection and enhanced krill herd algorithm for text document clustering","author":"LMQ Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin, pp 1\u2013165"},{"key":"6837_CR5","doi-asserted-by":"publisher","first-page":"107250","DOI":"10.1016\/j.cie.2021.107250","volume":"157","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-Qaness MA, Gandomi AH (2021a) Aquila optimizer: a novel meta-heuristic optimization Algorithm. Comput Ind Eng 157:107250","journal-title":"Comput Ind Eng"},{"key":"6837_CR6","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021b) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"6837_CR7","doi-asserted-by":"crossref","unstructured":"Alawad NA, Abed-Alguni BH (2021a) Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J Supercomput 1\u201322","DOI":"10.1007\/s11227-021-03998-9"},{"issue":"4","key":"6837_CR8","doi-asserted-by":"publisher","first-page":"3213","DOI":"10.1007\/s13369-020-05141-x","volume":"46","author":"NA Alawad","year":"2021","unstructured":"Alawad NA, Abed-Alguni BH (2021b) Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab J Sci Eng 46(4):3213\u20133233","journal-title":"Arab J Sci Eng"},{"key":"6837_CR9","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/5012313","author":"S Aslan","year":"2019","unstructured":"Aslan S (2019) A transition control mechanism for artificial bee colony (ABC) algorithm. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2019\/5012313","journal-title":"Comput Intell Neurosci"},{"issue":"1","key":"6837_CR10","first-page":"83","volume":"32","author":"AN Balaji","year":"2019","unstructured":"Balaji AN, Porselvi S, Jawahar N (2019) Particle swarm optimization algorithm and multi-start simulated annealing algorithm for scheduling batches of parts in multi-cell flexible manufacturing system. Int J Serv Oper Manag 32(1):83\u2013129","journal-title":"Int J Serv Oper Manag"},{"key":"6837_CR11","first-page":"274","volume":"157","author":"E Bottani","year":"2020","unstructured":"Bottani E, Murino T, Schiavo M, Akkerman R (2020) Resilient food supply chain design: modelling framework and metaheuristic solution approach. Comput Ind Eng 157:274\u2013289","journal-title":"Comput Ind Eng"},{"key":"6837_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.cie.2019.05.015","volume":"133","author":"M Castellani","year":"2019","unstructured":"Castellani M, Otri S, Pham DT (2019) Printed circuit board assembly time minimization using a novel Bees algorithm. Comput Ind Eng 133:186\u2013194","journal-title":"Comput Ind Eng"},{"key":"6837_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.engappai.2019.03.021","volume":"82","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kaur A (2019) STOA: a bio-inspired based optimization algorithm for industrial engineering problems. Eng Appl Artif Intell 82:148\u2013174","journal-title":"Eng Appl Artif Intell"},{"issue":"7","key":"6837_CR14","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TSMC.2017.2654301","volume":"48","author":"S Elarbi","year":"2018","unstructured":"Elarbi S, Bechikh A, Gupta LB, Said YS (2018) Ong, a new decomposition-based NSGA-II for many-objective optimization. IEEE Trans Syst, Man, Cybern: Syst 48(7):1191\u20131210","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"issue":"3","key":"6837_CR15","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1051\/ro\/2019018","volume":"53","author":"MB Fakhrzad","year":"2019","unstructured":"Fakhrzad MB, Goodarzian F (2019) A fuzzy multi-objective programming approach to develop a green closed-loop supply chain network design problem under uncertainty: modifications of imperialist competitive algorithm. RAIRO-Oper Res 53(3):963\u2013990","journal-title":"RAIRO-Oper Res"},{"key":"6837_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.engappai.2018.04.009","volume":"72","author":"AM Fathollahi-Fard","year":"2018","unstructured":"Fathollahi-Fard AM, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2018) The social engineering optimizer (SEO). Eng Appl Artif Intell 72:267\u2013293","journal-title":"Eng Appl Artif Intell"},{"key":"6837_CR17","doi-asserted-by":"publisher","first-page":"106103","DOI":"10.1016\/j.cie.2019.106103","volume":"137","author":"AM Fathollahi-Fard","year":"2019","unstructured":"Fathollahi-Fard AM, Ranjbar-Bourani M, Cheikhrouhou N, Hajiaghaei-Keshteli M (2019) Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system. Comput Ind Eng 137:106103","journal-title":"Comput Ind Eng"},{"issue":"2","key":"6837_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76(2):60\u201368","journal-title":"SIMULATION"},{"key":"6837_CR19","first-page":"105","volume":"350","author":"P Ghasemi","year":"2019","unstructured":"Ghasemi P, Khalili-Damghani K, Hafezalkotob A, Raissi S (2019) Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning. Appl Math Comput 350:105\u2013132","journal-title":"Appl Math Comput"},{"issue":"3","key":"6837_CR20","first-page":"190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA. J Comput 1(3):190\u2013206","journal-title":"J Comput"},{"issue":"6","key":"6837_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00607-018-00692-2","volume":"101","author":"A Goli","year":"2019","unstructured":"Goli A, Tirkolaee EB, Malmir B, Bian GB, Sangaiah AK (2019) A multi-objective invasive weed optimization algorithm for robust aggregate production planning under uncertain seasonal demand. Computing 101(6):499\u2013529","journal-title":"Computing"},{"key":"6837_CR22","doi-asserted-by":"publisher","first-page":"106331","DOI":"10.1016\/j.asoc.2020.106331","volume":"92","author":"F Goodarzian","year":"2020","unstructured":"Goodarzian F, Hosseini-Nasab H, Mu\u00f1uzuri J, Fakhrzad MB (2020) A multi-objective pharmaceutical supply chain network based on a robust fuzzy model: a comparison of meta-heuristics. Appl Soft Comput 92:106331","journal-title":"Appl Soft Comput"},{"issue":"11","key":"6837_CR23","doi-asserted-by":"publisher","first-page":"7527","DOI":"10.1007\/s00500-021-05711-7","volume":"25","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Kumar V, Abraham A (2021a) Hybrid meta-heuristic algorithms for a supply chain network considering different carbon emission regulations using big data characteristics. Soft Comput 25(11):7527\u20137557","journal-title":"Soft Comput"},{"key":"6837_CR24","doi-asserted-by":"publisher","first-page":"107389","DOI":"10.1016\/j.cie.2021.107389","volume":"158","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Kumar V, Ghasemi P (2021b) \u201cA set of efficient heuristics and meta-heuristics to solve a multi-objective pharmaceutical supply chain network. Comput Ind Eng 158:107389","journal-title":"Comput Ind Eng"},{"issue":"1","key":"6837_CR25","first-page":"452","volume":"8","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Abraham A, Fathollahi-Fard AM (2021c) A biobjective home health care logistics considering the working time and route balancing: a self-adaptive social engineering optimizer. J Comput Des Eng 8(1):452\u2013474","journal-title":"J Comput Des Eng"},{"key":"6837_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04238-2","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Ghasemi P, Gunasekaren A, Taleizadeh AA, Abraham A (2021d) A sustainable-resilience healthcare network for handling COVID-19 pandemic. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-021-04238-2","journal-title":"Ann Oper Res"},{"key":"6837_CR27","doi-asserted-by":"publisher","first-page":"104188","DOI":"10.1016\/j.engappai.2021.104188","volume":"100","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Taleizadeh AA, Ghasemi P, Abraham A (2021e) An integrated sustainable medical supply chain network during COVID-19. Eng Appl Artif Intell 100:104188","journal-title":"Eng Appl Artif Intell"},{"key":"6837_CR28","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.asoc.2018.10.030","volume":"74","author":"S Goudarzi","year":"2019","unstructured":"Goudarzi S, Anisi MH, Abdullah AH, Lloret J, Soleymani SA, Hassan WH (2019) A hybrid intelligent model for network selection in the industrial internet of things. Appl Soft Comput 74:529\u2013546","journal-title":"Appl Soft Comput"},{"key":"6837_CR29","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.apm.2020.03.028","volume":"84","author":"V Hajipour","year":"2020","unstructured":"Hajipour V, Tavana M, Di Caprio D, Akhgar M, Jabbari Y (2020) An optimization model for traceable closed-loop supply chain networks. Appl Math Model 84:265\u2013279","journal-title":"Appl Math Model"},{"issue":"1","key":"6837_CR30","first-page":"27","volume":"4","author":"S Kamaruddin","year":"2019","unstructured":"Kamaruddin S, Latif MAHA (2019) Application of the bees algorithm for constrained mechanical design optimization problem. Int J Eng Mater Manuf 4(1):27\u201332","journal-title":"Int J Eng Mater Manuf"},{"key":"6837_CR31","doi-asserted-by":"crossref","unstructured":"Karaboga D, Basturk B (2007) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: International fuzzy systems association world congress, pp 789\u2013798. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-72950-1_77"},{"key":"6837_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization (PSO). In: Proc. IEEE international conference on neural networks, Perth, Australia, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"6837_CR33","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TCYB.2018.2796119","volume":"49","author":"D Lei","year":"2018","unstructured":"Lei D, Li M, Wang L (2018) A two-phase meta-heuristic for multi-objective flexible job shop scheduling problem with total energy consumption threshold. IEEE Trans Cybern 49(3):1097\u20131109","journal-title":"IEEE Trans Cybern"},{"issue":"10","key":"6837_CR34","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1109\/TCYB.2015.2424836","volume":"45","author":"J Li","year":"2015","unstructured":"Li J, Zhang JQ, Jiang CJ, Zhou MC (2015) Composite particle swarm optimizer with historical memory for function optimization. IEEE Trans Cybern 45(10):2350\u20132363","journal-title":"IEEE Trans Cybern"},{"key":"6837_CR35","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.matcom.2018.08.011","volume":"156","author":"J Luan","year":"2019","unstructured":"Luan J, Yao Z, Zhao F, Song X (2019) A novel method to solve supplier selection problem: hybrid algorithm of genetic algorithm and ant colony optimization. Math Comput Simul 156:294\u2013309","journal-title":"Math Comput Simul"},{"issue":"2","key":"6837_CR36","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TSMC.2016.2591267","volume":"48","author":"X Meng","year":"2016","unstructured":"Meng X, Li J, Zhou M, Dai X, Dou J (2016) Population-based incremental learning algorithm for a serial colored traveling salesman problem. IEEE Trans Syst, Man, Cybern: Syst 48(2):277\u2013288","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"key":"6837_CR37","unstructured":"Mitchell M, Forrest S, Holland JH (1992) The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proceedings of the 1st European conference on artificial life, pp 245\u2013254"},{"issue":"12","key":"6837_CR38","doi-asserted-by":"publisher","first-page":"7615","DOI":"10.1016\/j.eswa.2010.04.081","volume":"37","author":"S Nazari-Shirkouhi","year":"2010","unstructured":"Nazari-Shirkouhi S, Eivazy H, Ghodsi R, Rezaie K, Atashpaz-Gargari E (2010) Solving the integrated product mix-outsourcing problem using the imperialist competitive algorithm. Expert Syst Appl 37(12):7615\u20137626","journal-title":"Expert Syst Appl"},{"key":"6837_CR39","first-page":"236","volume":"109","author":"M Okulewicz","year":"2019","unstructured":"Okulewicz M, Ma\u0144dziuk J (2019) A metaheuristic approach to solve dynamic vehicle routing problem in continuous search space. Swarm Evol Comput 109:236\u2013245","journal-title":"Swarm Evol Comput"},{"key":"6837_CR40","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.engappai.2018.12.010","volume":"79","author":"S Pech","year":"2019","unstructured":"Pech S, Kandler G, Lukacevic M, F\u00fcssl J (2019) Metamodel assisted optimization of glued laminated timber beams by using metaheuristic algorithms. Eng Appl Artif Intell 79:129\u2013141","journal-title":"Eng Appl Artif Intell"},{"key":"6837_CR41","unstructured":"Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S, Zaidi M (2005) The bee's algorithm. Technical note, Manufacturing Engineering Centre, Cardiff University, UK"},{"issue":"7","key":"6837_CR42","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TSMC.2013.2282118","volume":"44","author":"P Rakshit","year":"2014","unstructured":"Rakshit P, Konar A, Das S, Jain LC, Nagar AK (2014) Uncertainty management in differential evolution induced multi-objective optimization in presence of measurement noise. IEEE Trans Syst, Man, Cybern: Syst 44(7):922\u2013937","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"key":"6837_CR43","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.engappai.2019.02.003","volume":"81","author":"A Ram\u00edrez","year":"2019","unstructured":"Ram\u00edrez A, Romero JR, Garc\u00eda-Mart\u00ednez C, Ventura S (2019) JCLEC-MO: a Java suite for solving many-objective optimization engineering problems. Eng Appl Artif Intell 81:14\u201328","journal-title":"Eng Appl Artif Intell"},{"key":"6837_CR44","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.trc.2019.02.018","volume":"102","author":"D Sacramento","year":"2019","unstructured":"Sacramento D, Pisinger D, Ropke S (2019) An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Transp Res Part c: Emerging Technol 102:289\u2013315","journal-title":"Transp Res Part c: Emerging Technol"},{"key":"6837_CR45","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.engappai.2019.01.001","volume":"80","author":"S Shadravan","year":"2019","unstructured":"Shadravan S, Naji HR, Bardsiri VK (2019) The Sailfish Optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Eng Appl Artif Intell 80:20\u201334","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"6837_CR46","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11053-019-09503-7","volume":"29","author":"Y Shang","year":"2020","unstructured":"Shang Y, Nguyen H, Bui XN, Tran QH, Moayedi H (2020) A novel artificial intelligence approach to predict blast-induced ground vibration in open-pit mines based on the firefly algorithm and artificial neural network. Nat Resour Res 29(2):723\u2013737","journal-title":"Nat Resour Res"},{"issue":"6","key":"6837_CR47","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"key":"6837_CR48","first-page":"163","volume":"4","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Dorigo M (1999) A CO algorithms for the traveling salesman problem. Evol Algor Eng Comput Sci 4:163\u2013183","journal-title":"Evol Algor Eng Comput Sci"},{"issue":"5","key":"6837_CR49","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1080\/00207160.2018.1463438","volume":"96","author":"JH Tam","year":"2019","unstructured":"Tam JH, Ong ZC, Ismail Z, Ang BC, Khoo SY (2019) A new hybrid GA\u2212ACO\u2212PSO algorithm for solving various engineering design problems. Int J Comput Math 96(5):883\u2013919","journal-title":"Int J Comput Math"},{"issue":"10","key":"6837_CR50","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1109\/TSMC.2017.2720178","volume":"48","author":"K Wang","year":"2018","unstructured":"Wang K, Luo H, Liu F, Yue X (2018) Permutation flow shop scheduling with batch delivery to multiple customers in supply chains. IEEE Trans Syst, Man, Cybern: Syst 48(10):1826\u20131837","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"key":"6837_CR51","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cie.2018.12.054","volume":"128","author":"E Yadegari","year":"2019","unstructured":"Yadegari E, Alem-Tabriz A, Zandieh M (2019) A memetic algorithm with a novel neighbourhood search and modified solution representation for closed-loop supply chain network design. Comput Ind Eng 128:418\u2013436","journal-title":"Comput Ind Eng"},{"key":"6837_CR52","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) Firefly algorithm, Levy flights and global optimization. In: Research and development in intelligent systems, vol XXVI, pp 209\u2013218. Springer, London","DOI":"10.1007\/978-1-84882-983-1_15"},{"key":"6837_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2019.01.004","volume":"170","author":"J Yi","year":"2019","unstructured":"Yi J, Gao L, Li X, Shoemaker CA, Lu C (2019) An on-line variable-fidelity surrogate-assisted harmony search algorithm with multi-level screening strategy for expensive engineering design optimization. Knowl-Based Syst 170:1\u201319","journal-title":"Knowl-Based Syst"},{"key":"6837_CR54","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2937565","author":"X Zhang","year":"2020","unstructured":"Zhang X, Du KJ, Zhan ZH, Kwong S, Gu TL, Zhang J (2020) Cooperative coevolutionary bare-bones particle swarm optimization with function independent decomposition for large-scale supply chain network design with uncertainties. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2019.2937565","journal-title":"IEEE Trans Cybern"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06837-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-06837-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06837-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T03:04:53Z","timestamp":1668049493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-06837-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":54,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["6837"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-06837-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"25 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human or animal subjects performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}},{"value":"Informed consent was not required as no humans or animals were involved.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}