{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T11:31:12Z","timestamp":1785843072746,"version":"3.56.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001775","name":"University of Technology Sydney","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001775","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, a surrogate merit function (SMF) is proposed to be evaluated instead of the traditional <jats:italic>merit functions<\/jats:italic> (i.e., penalized weight of the structure). The standard format of the conventional <jats:italic>merit functions<\/jats:italic> needs several expensive trial-and-error tuning processes to enhance optimization convergence quality, retuning for different structural model configurations, and final manual local search in case optimization converges to infeasible vicinity of global optimum. However, on the other hand, SMF has no tunning factor but shows statistically stable performance for different models, converges directly to outstanding feasible points, and shows other superior advantages such as reduced required iterations to achieve convergence. In other words, this new function is a no-hassle one due to its brilliant user-friendly application and robust numerical results. SMF might be a revolutionary step in commercializing design optimization in the real-world construction market.<\/jats:p>","DOI":"10.1007\/s00500-022-07453-6","type":"journal-article","created":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T07:05:22Z","timestamp":1661843122000},"page":"1533-1563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A surrogate merit function developed for structural weight optimization problems"],"prefix":"10.1007","volume":"27","author":[{"given":"N.","family":"Sadrekarimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Talatahari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B. Farahmand","family":"Azar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. H.","family":"Gandomi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"key":"7453_CR1","unstructured":"AISC (2010) Specification for structural steel buildings (ANSI\/AISC 360-10), Chicago, IL: American Institute of Steel Construction"},{"key":"7453_CR2","unstructured":"ASCE 7\u201398 (2000) Minimum design loads for buildings and other structures: Revision of ANSI\/ASCE 7\u201395, American Society of Civil Engineers"},{"key":"7453_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.compstruc.2015.04.009","volume":"156","author":"SK Azad","year":"2015","unstructured":"Azad SK, Hasan\u00e7ebi O (2015) Computationally efficient discrete sizing of steel frames via guided stochastic search heuristic. Comput Struct 156:12\u201328","journal-title":"Comput Struct"},{"issue":"2","key":"7453_CR4","first-page":"233","volume":"4","author":"SK Azad","year":"2014","unstructured":"Azad SK, Hasan\u00e7ebi O, Azad SK (2014) Computationally efficient optimum design of large-scale steel frames. Int J Optim Civil Eng 4(2):233\u2013259","journal-title":"Int J Optim Civil Eng"},{"key":"7453_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.advengsoft.2012.11.016","volume":"57","author":"SK Azad","year":"2013","unstructured":"Azad SK, Hasan\u00e7ebi O, Azad SK (2013) Upper bound strategy for metaheuristic-based design optimization of steel frames. Adv Eng Softw 57:19\u201332","journal-title":"Adv Eng Softw"},{"issue":"4","key":"7453_CR6","first-page":"563","volume":"3","author":"SK Azad","year":"2013","unstructured":"Azad SK, Hasan\u00e7ebi O (2013) Improving computational efficiency of particle swarm optimization for optimal structural design. Int J Optim Civil Eng 3(4):563\u2013574","journal-title":"Int J Optim Civil Eng"},{"key":"7453_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.engstruct.2019.05.007","volume":"192","author":"M Azizi","year":"2019","unstructured":"Azizi M, Ejlalia RG, Ghasemia SAM, Talatahari S (2019) Upgraded Whale Optimization Algorithm for fuzzy logic based vibration control of nonlinear steel structure. Eng Struct 192:53\u201370","journal-title":"Eng Struct"},{"key":"7453_CR8","unstructured":"Bean JC, Hadj-Alouane AB (1992) A dual genetic algorithm for bounded integer programs. Technical Report TR 92\u201353, Department of Industrial and Operations Engineering, The University of Michigan"},{"issue":"2","key":"7453_CR9","doi-asserted-by":"publisher","first-page":"04015019","DOI":"10.1061\/(ASCE)CP.1943-5487.0000487","volume":"30","author":"S Bureerat","year":"2016","unstructured":"Bureerat S, Pholdee N (2016) Optimal truss sizing using an adaptive differential evolution algorithm. J Comput Civil Eng 30(2):04015019","journal-title":"J Comput Civil Eng"},{"issue":"7","key":"7453_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.3844\/jcssp.2016.350.362","volume":"12","author":"A Chehouri","year":"2016","unstructured":"Chehouri A, Younes R, Perron J, Ilinca A (2016) A constraint-handling technique for genetic algorithms using a violation factor. J Comput Sci 12(7):350\u2013362","journal-title":"J Comput Sci"},{"key":"7453_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"MY Cheng","year":"2014","unstructured":"Cheng MY, Prayogo D (2014) Symbiotic Organisms Search: a new metaheuristic optimization algorithm. Comput Struct 139:98\u2013112","journal-title":"Comput Struct"},{"key":"7453_CR12","unstructured":"Cheng FY, Li D (1997) Fuzzy set theory with genetic algorithms in constrained structural optimization. In: ASCE proceeding of us-japan joint seminar on structural optimization. Advances in structural optimization, New York, pp 55\u201356"},{"issue":"11\u201312","key":"7453_CR13","first-page":"1245","volume":"191","author":"CAC Coello","year":"2001","unstructured":"Coello CAC (2001) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11\u201312):1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"2\u20134","key":"7453_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2\u20134):311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"key":"7453_CR15","unstructured":"Dorigo M, St\u00fctzle Th. Ant Colony Optimization. MIT Press,\u00a0ISBN\u00a00-262-04219-3"},{"issue":"5","key":"7453_CR16","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00158-015-1252-x","volume":"52","author":"LS Duarte","year":"2015","unstructured":"Duarte LS, Celes W, Pereira A, Menezes IFM, Paulino GH (2015) PolyTop++: an efficient alternative for serial and parallel topology optimization on CPUs & GPU. Struct Multidiscip Optim 52(5):845\u2013859","journal-title":"Struct Multidiscip Optim"},{"issue":"12","key":"7453_CR17","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1002\/nme.5203","volume":"107","author":"PD Dunning","year":"2016","unstructured":"Dunning PD, Ovtchinnikov E, Scott J, Kim HA (2016) Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver. Int J Numer Meth Eng 107(12):1029\u20131053","journal-title":"Int J Numer Meth Eng"},{"key":"7453_CR18","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science. Nagoya, Japan"},{"issue":"2","key":"7453_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.advengsoft.2005.04.005","volume":"37","author":"OK Erol","year":"2006","unstructured":"Erol OK, Eksin I (2006) New optimization method: Big Bang-Big crunch. Adv Eng Softw 37(2):106\u2013111","journal-title":"Adv Eng Softw"},{"issue":"4","key":"7453_CR20","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.isatra.2014.03.018","volume":"53","author":"AH Gandomi","year":"2014","unstructured":"Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168\u20131183","journal-title":"ISA Trans"},{"key":"7453_CR21","unstructured":"Gargari EA, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, Singapore"},{"issue":"2","key":"7453_CR22","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":"7453_CR23","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/0305215X.2012.704028","volume":"45","author":"S Gholizadeh","year":"2012","unstructured":"Gholizadeh S, Barzegar A (2012) Shape optimization of structures for frequency constraints by sequential harmony search algorithm. Eng Optim 45:627\u2013646","journal-title":"Eng Optim"},{"issue":"3","key":"7453_CR24","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.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":"ORSA J Comput"},{"issue":"1","key":"7453_CR25","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"issue":"1","key":"7453_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1061\/(ASCE)0733-9496(2008)134:1(64)","volume":"134","author":"J Guan","year":"2008","unstructured":"Guan J, Kentel E, Aral MM (2008) Genetic algorithm for constrained optimization models and its application in groundwater resources management. J Water Resour Plan Manag 134(1):64\u201372","journal-title":"J Water Resour Plan Manag"},{"issue":"1\u20134","key":"7453_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01170179","volume":"139","author":"O Hasan\u00e7ebi","year":"2000","unstructured":"Hasan\u00e7ebi O, Erbatur F (2000) Constraint handling in genetic algorithm integrated structural optimization. Acta Mech 139(1\u20134):15\u201331","journal-title":"Acta Mech"},{"issue":"1\u20132","key":"7453_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.compstruc.2007.05.012","volume":"86","author":"O Hasan\u00e7ebi","year":"2008","unstructured":"Hasan\u00e7ebi O (2008) Adaptive evolution strategies in structural optimization: Enhancing their computational performance with applications to large-scale structures. Comput Struct 86(1\u20132):119\u2013132","journal-title":"Comput Struct"},{"issue":"7","key":"7453_CR29","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1260\/1369-4332.18.7.1003","volume":"18","author":"O Hasan\u00e7ebi","year":"2015","unstructured":"Hasan\u00e7ebi O, Azad SK (2015) Improving computational efficiency of bat-inspired algorithm in optimal structural design. Adv Struct Eng 18(7):1003\u20131015","journal-title":"Adv Struct Eng"},{"key":"7453_CR30","unstructured":"Hoffmeister F, Sprave J (1996) Problem-independent handling of constraints by use of metric penalty functions. In: Proceedings of the fifth annual conference on evolutionary programming, MIT Press 289\u2013294, San Diego, CA, pp 289\u2013294"},{"key":"7453_CR31","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"7453_CR32","unstructured":"Joines J, Houck C (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with Gas. In: Fogel D (ed.), Proceedings of the First IEEE conference on evolutionary computation, IEEE Press. Florida, USA; pp 579\u2013584."},{"key":"7453_CR33","unstructured":"Karabo\u011fa D (2005) An idea based on honey bee swarm for numerical optimization"},{"key":"7453_CR34","doi-asserted-by":"crossref","unstructured":"Kambampati S, Jauregui C, Museth K, Kim HA (2018) Fast level set topology optimization using a hierarchical data structure. In: Multidisciplinary analysis and optimization conference","DOI":"10.2514\/6.2018-3881"},{"issue":"2","key":"7453_CR35","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1243\/09544062JMES1732","volume":"224","author":"TH Kim","year":"2010","unstructured":"Kim TH, Maruta I, Sugie T (2010) A simple and efficient constrained particle swarm optimization and its application to engineering design problems. Proc Inst Mech Eng C J Mech Eng Sci 224(2):389\u2013400","journal-title":"Proc Inst Mech Eng C J Mech Eng Sci"},{"issue":"3\u20134","key":"7453_CR36","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00707-009-0270-4","volume":"213","author":"A Kaveh","year":"2010","unstructured":"Kaveh A, Talatahari S (2010a) A novel heuristic optimization method: charged system search. Acta Mech 213(3\u20134):267\u2013289","journal-title":"Acta Mech"},{"key":"7453_CR37","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.compstruc.2012.03.016","volume":"102","author":"A Kaveh","year":"2012","unstructured":"Kaveh A, Zolghadr A (2012) Truss optimization with natural frequency constraints using a hybridized CSS-BBBC algorithm with trap recognition capability. Comput Struct 102:14\u201327","journal-title":"Comput Struct"},{"issue":"1","key":"7453_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1108\/02644401011008577","volume":"27","author":"A Kaveh","year":"2010","unstructured":"Kaveh A, Talatahari S (2010b) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155\u2013182","journal-title":"Eng Comput"},{"key":"7453_CR39","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000493","author":"S Lee","year":"2015","unstructured":"Lee S, Kang T (2015) Analysis of constrained optimization problems by the SCE-UA with an adaptive penalty function. J Comput Civ Eng. https:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000493","journal-title":"J Comput Civ Eng"},{"issue":"2","key":"7453_CR40","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TEVC.2008.926731","volume":"3","author":"G Leguizam\u00f3n","year":"2009","unstructured":"Leguizam\u00f3n G, Coello CAC (2009) Boundary search for constrained numerical optimization problems with an algorithm inspired by the ant colony metaphor. IEEE Trans Evol Comput 3(2):350\u2013368","journal-title":"IEEE Trans Evol Comput"},{"key":"7453_CR41","doi-asserted-by":"crossref","unstructured":"Liu Zh, Li Z, Ping Zh, Chen W. A parallel boundary search particle swarm optimization algorithm for constrained optimization problems. Structural and Multidisciplinary Optimization 2018.","DOI":"10.1007\/s00158-018-1978-3"},{"issue":"4","key":"7453_CR42","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TEVC.2009.2033582","volume":"14","author":"R Mallipeddi","year":"2010","unstructured":"Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14(4):561\u2013579","journal-title":"IEEE Trans Evol Comput"},{"key":"7453_CR43","unstructured":"Mendez AM, Coello CAC (2009) A new proposal to hybridize the Nelder-mead method to a differential evolution algorithm for constrained optimization. In: IEEE Congress on evolutionary computation, Trondheim, Norway"},{"key":"7453_CR44","unstructured":"Michalewic Z, Attia NF (1994) Evolutionary optimization of constrained problems. In: Proceedings of the 3rd annual conference on evolutionary programming, World Scientific, Singapore, pp 98\u2013108"},{"issue":"4","key":"7453_CR45","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"EM Montes","year":"2011","unstructured":"Montes EM, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1(4):173\u2013194","journal-title":"Swarm Evol Comput"},{"key":"7453_CR46","unstructured":"Morales AK, Quezada CV (1998) A universal eclectic genetic algorithm for constrained optimization. In: Proceedings of the 6th european congress on intelligent techniques and soft computing, Aachen, Germany; pp 518\u2013522"},{"key":"7453_CR47","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.eswa.2011.07.031","volume":"39","author":"S Mun","year":"2012","unstructured":"Mun S, Cho Y (2012) Modified harmony search optimization for constrained design problems. Expert Syst Appl 39:419\u2013423","journal-title":"Expert Syst Appl"},{"issue":"1","key":"7453_CR48","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00158-010-0543-5","volume":"43","author":"S Nema","year":"2011","unstructured":"Nema S, Goulermas JY, Sparrow G, Helman P (2011) A hybrid cooperative search algorithm for constrained optimization. Struct Multidiscip Optim 43(1):107\u2013119","journal-title":"Struct Multidiscip Optim"},{"key":"7453_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.advengsoft.2014.04.005","volume":"75","author":"N Pholdee","year":"2014","unstructured":"Pholdee N, Bureerat S (2014) Comparative performance of meta-heuristic algorithms for mass minimisation of trusses with dynamic constraints. Adv Eng Softw 75:1\u201313","journal-title":"Adv Eng Softw"},{"issue":"6","key":"7453_CR50","doi-asserted-by":"publisher","first-page":"2727","DOI":"10.1007\/s00158-018-2094-0","volume":"58","author":"ED Sanders","year":"2018","unstructured":"Sanders ED, Pereira A, Aguil\u00f3 MA, Paulino GH (2018) PolyMat: an efficient Matlab code for multi-material topology optimization. Struct Multidiscip Optim 58(6):2727\u20132759","journal-title":"Struct Multidiscip Optim"},{"key":"7453_CR51","unstructured":"Skalak SC, Shonkwiler R (1998) Annealing a genetic algorithm over constraints. In: IEEE international conference on systems, man, and cybernetics, CA, USA"},{"key":"7453_CR52","unstructured":"Smith AE, Tate DM (1993) Genetic optimization using a penalty function. In: Forrest S (Ed.), Proceedings of the fifth international conference on genetic algorithms, University of Illinois at Urbana-Champaign, Morgan Kaufmann, San Mateo, CA; pp 499\u2013503"},{"issue":"4","key":"7453_CR53","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"6","key":"7453_CR54","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1007\/s00158-018-2181-2","volume":"59","author":"L Stripinis","year":"2019","unstructured":"Stripinis L, Paulavi\u010dius R, \u017dilinskas J (2019) Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization. Struct Multidiscip Optim 59(6):2155\u20132175","journal-title":"Struct Multidiscip Optim"},{"key":"7453_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s13296-022-00598-y","author":"S Talatahari","year":"2022","unstructured":"Talatahari S, Azizi M, Toloo M et al (2022) Optimization of large-scale frame structures using fuzzy adaptive quantum inspired charged system search. Int J Steel Struct. https:\/\/doi.org\/10.1007\/s13296-022-00598-y","journal-title":"Int J Steel Struct"},{"key":"7453_CR56","doi-asserted-by":"publisher","first-page":"106560","DOI":"10.1016\/j.cie.2020.106560","volume":"145","author":"S Talatahari","year":"2020","unstructured":"Talatahari S, Azizi M (2020) Optimization of constrained mathematical and engineering design problems using chaos game optimization. Comput Ind Eng 145:106560","journal-title":"Comput Ind Eng"},{"issue":"6","key":"7453_CR57","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00158-004-0415-y","volume":"28","author":"S Venkataraman","year":"2004","unstructured":"Venkataraman S, Haftka RT (2004) Structural optimization complexity: what has Moore\u2019s law done for us? Struct Multidiscip Optim 28(6):375\u2013387","journal-title":"Struct Multidiscip Optim"},{"key":"7453_CR58","doi-asserted-by":"crossref","unstructured":"Yang XS (2016) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NISCO) studies in computational intelligence, vol 284, pp 65\u201374. http:\/\/arxiv.org\/abs\/1004.4170. Bibcode:2010arXiv1004.4170Y.","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"7453_CR59","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via levy flights. In: World congress on nature and biologically inspired computing; pp 210\u2013214","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"7453_CR60","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (Eds.), Fifth Symposium on stochastic algorithms, foundation and applications (SAGA), LNCS, 5792, pp 169\u2013178","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"7453_CR61","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms, 1st edn. Luniver Press, Frome","edition":"1"},{"key":"7453_CR62","doi-asserted-by":"crossref","unstructured":"Yousefi M, Yousefi M, Darus A (2012) A modified imperialist competitive algorithm for constrained optimization of plate-fin heat exchangers. In: Proceedings of the institution of mechanical engineers, part a: journal of power and energy, originally, pp 226\u20131050","DOI":"10.1177\/0957650912455578"},{"issue":"2","key":"7453_CR63","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ifacol.2017.12.038","volume":"50","author":"A Zade","year":"2017","unstructured":"Zade A, Patel N, Padhiyar N (2017) Effective constrained handling by hybridized cuckoo search algorithm with box complex method. IFAC PapersOnLine 50(2):209\u2013214","journal-title":"IFAC PapersOnLine"},{"key":"7453_CR64","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8:338\u2013353","journal-title":"Inf Control"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07453-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07453-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07453-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T07:10:33Z","timestamp":1674803433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07453-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,30]]},"references-count":64,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["7453"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07453-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,30]]},"assertion":[{"value":"12 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}