{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T17:22:15Z","timestamp":1779124935334,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T00:00:00Z","timestamp":1629590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T00:00:00Z","timestamp":1629590400000},"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":["OR Spectrum"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00291-021-00650-z","type":"journal-article","created":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T03:15:15Z","timestamp":1629602115000},"page":"249-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6016-2402","authenticated-orcid":false,"given":"Ran","family":"Etgar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,22]]},"reference":[{"issue":"4","key":"650_CR1","first-page":"24","volume":"10","author":"KA Al-Sheshtawi","year":"2010","unstructured":"Al-Sheshtawi KA, Abdul-Kader HM, Ismail NA (2010) study of CLONALG, opt-IA, and BCA with numerical optimization problems. Int J Comput Sci Netw Secur 10(4):24\u201330","journal-title":"Int J Comput Sci Netw Secur"},{"issue":"1","key":"650_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0965-9978(00)00070-3","volume":"32","author":"J Andre","year":"2001","unstructured":"Andre J, Siarry P, Dognon T (2001) An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization. Adv Eng Softw 32(1):49\u201360","journal-title":"Adv Eng Softw"},{"issue":"2","key":"650_CR5","first-page":"145","volume":"120","author":"D Bhandari","year":"2012","unstructured":"Bhandari D, Murthy CA, Pal SK (2012) Variance as a stopping criterion for genetic algorithms with elitist model. Fund Inform 120(2):145\u2013164","journal-title":"Fund Inform"},{"issue":"3","key":"650_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268\u2013308","journal-title":"ACM Comput Surv (CSUR)"},{"key":"650_CR7","volume-title":"Clonal selection theory & clonalg-the clonal selection classification algorithm (csca)","author":"J Brownlee","year":"2005","unstructured":"Brownlee J (2005) Clonal selection theory & clonalg-the clonal selection classification algorithm (csca). Swinburne University of Technology, Swinburne, Australia"},{"issue":"1","key":"650_CR9","first-page":"8","volume":"2","author":"S Chitra","year":"2010","unstructured":"Chitra S, MadhuSudhanan B, Rajaram M, Sivanandham SN (2010) Investigation of data clustering preprocessing algorithm on independent attributes to improve the performance of CLONALG. Int J Comput Sci Eng 2(1):8\u201311","journal-title":"Int J Comput Sci Eng"},{"issue":"1","key":"650_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58\u201373","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR14","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du J, Leung JT (1990) Minimizing total tardiness on one machine is NP-hard. Math Op Res 15:483\u2013495","journal-title":"Math Op Res"},{"key":"650_CR15","doi-asserted-by":"crossref","unstructured":"Eiben AE, Aarts EH, Van Hee KM (1990) Global convergence of genetic algorithms: a Markov chain analysis. In:\u00a0International conference on parallel problem solving from nature. Springer, Berlin, Heidelberg, pp 3\u201312","DOI":"10.1007\/BFb0029725"},{"key":"650_CR19","unstructured":"Glorieux E (2015) Constructive cooperative coevolution for optimising interacting production stations. Doctoral dissertation, University West"},{"issue":"24","key":"650_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1103\/PhysRevLett.102.240602","volume":"102","author":"C Godreche","year":"2009","unstructured":"Godreche C, Majumdar SN, Schehr G (2009) Longest excursion of stochastic processes in nonequilibrium systems. Phys Rev Lett 102(24):67","journal-title":"Phys Rev Lett"},{"issue":"8","key":"650_CR26","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2014","unstructured":"Gutjahr WJ (2014) A graph-based ant system and its convergence. Futur Gener Comput Syst 16(8):873\u2013888","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"650_CR27","first-page":"67","volume":"2","author":"MP Ha","year":"2014","unstructured":"Ha MP, Kumar L, Ananthapadmanabha T (2014) A novel approach for optimal allocation of a distributed generator in a radial distribution feeder for loss minimization and tail end node voltage improvement during peak load. Int Trans Electr Comput Engine Syst 2(2):67\u201372","journal-title":"Int Trans Electr Comput Engine Syst"},{"issue":"4","key":"650_CR30","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.infsof.2014.01.001","volume":"56","author":"CL Hermadi","year":"2014","unstructured":"Hermadi CL, Sarker R (2014) Dynamic stopping criteria for search-based test data generation for path testing. Inf Softw Technol 56(4):395\u2013407","journal-title":"Inf Softw Technol"},{"key":"650_CR31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"J Holland","year":"1992","unstructured":"Holland J (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, Cambridge"},{"issue":"3","key":"650_CR34","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1162\/106365602760234117","volume":"10","author":"R Kumar","year":"2002","unstructured":"Kumar R, Rockett P (2002) Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm. Evol Comput 10(3):283\u2013314","journal-title":"Evol Comput"},{"key":"650_CR36","first-page":"343","volume-title":"Complexity of machine scheduling problems, Annals of discrete mathematics","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AR, Brucker P (1977) Complexity of machine scheduling problems, Annals of discrete mathematics. Elsevier, Amsterdam, pp 343\u2013362"},{"issue":"3","key":"650_CR38","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"HL Liu","year":"2014","unstructured":"Liu HL, Gu F, Zhang Q (2014) Decomposition of a multi-objective optimization problem into a number of simple multi-objective sub-problems. IEEE Trans Evol Comput 18(3):450\u2013455","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR40","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Program 34(1):111\u2013124","journal-title":"Math Program"},{"issue":"3","key":"650_CR41","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cedpsych.2009.05.001","volume":"34","author":"K Morsanyi","year":"2009","unstructured":"Morsanyi K, Primi C, Chiesi F, Handley S (2009) The effects and side-effects of statistics education: Psychology students\u2019(mis-) conceptions of probability. Contemp Educ Psychol 34(3):210\u2013220","journal-title":"Contemp Educ Psychol"},{"key":"650_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-018-9378-9","volume":"24","author":"AC Nearchou","year":"2018","unstructured":"Nearchou AC (2018) Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm. J Heuristics 24:1\u201335","journal-title":"J Heuristics"},{"issue":"41","key":"650_CR44","doi-asserted-by":"publisher","first-page":"8373","DOI":"10.1088\/0305-4470\/31\/41\/011","volume":"31","author":"Y Nourani","year":"1998","unstructured":"Nourani Y, Andresen B (1998) A comparison of simulated annealing cooling strategies. J Phys A: Math Gen 31(41):8373\u20138385","journal-title":"J Phys A: Math Gen"},{"key":"650_CR45","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047\u20131077","journal-title":"Appl Soft Comput"},{"key":"650_CR47","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cherd.2017.05.030","volume":"124","author":"GP Rangaiah","year":"2017","unstructured":"Rangaiah GP, Sharma S, Lin HW (2017) Evaluation of two termination criteria in evolutionary algorithms for multi-objective optimization of complex chemical processes. Chem Eng Res Des 124:58\u201365","journal-title":"Chem Eng Res Des"},{"key":"650_CR48","first-page":"141","volume":"2","author":"GE Rawlins","year":"1993","unstructured":"Rawlins GE, Sushil JL (1993) Syntactic analysis of convergence in genetic algorithms. Found Genet Algorithms 2:141\u2013151","journal-title":"Found Genet Algorithms"},{"issue":"1","key":"650_CR49","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) Convergence analysis of canonical genetic algorithms. EEE Trans Neural Netw 5(1):96\u2013101","journal-title":"EEE Trans Neural Netw"},{"issue":"4","key":"650_CR51","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TEVC.2015.2480780","volume":"20","author":"DK Saxena","year":"2016","unstructured":"Saxena DK, Sinha A, Duro JA, Zhang Q (2016) Entropy-based termination criterion for multiobjective evolutionary algorithms. EEE Transactions on Evolutionary Computation 20(4):485\u2013498","journal-title":"EEE Transactions on Evolutionary Computation"},{"issue":"4","key":"650_CR53","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TEVC.2016.2641477","volume":"21","author":"C Segura","year":"2016","unstructured":"Segura C, Hern\u00e1ndez-Aguirre A, Luna F, Alba E (2016) Improving diversity in evolutionary algorithms: New best solutions for frequency assignment. IEEE Trans Evol Comput 21(4):539\u2013553","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR54","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"FJ Solis","year":"1981","unstructured":"Solis FJ, Wets RJ (1981) Minimization by random search techniques. Math Oper Res 6(1):19\u201330","journal-title":"Math Oper Res"},{"key":"650_CR55","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ins.2015.09.056","volume":"329","author":"G Squillero","year":"2016","unstructured":"Squillero G, Tonda A (2016) Divergence of character and premature convergence: A survey of methodologies for promoting diversity in evolutionary optimization. Inf Sci 329:782\u2013799","journal-title":"Inf Sci"},{"key":"650_CR56","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.cam.2013.11.008","volume":"261","author":"CFM Toledo","year":"2014","unstructured":"Toledo CFM, Oliveira L, Fran\u00e7a PM (2014) Global optimization using a genetic algorithm with hierarchically structured population. J Comput Appl Math 261:341\u2013351","journal-title":"J Comput Appl Math"},{"issue":"1","key":"650_CR57","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1198\/000313008X267839","volume":"62","author":"F Tuyl","year":"2008","unstructured":"Tuyl F, Gerlach R, Mengersen K (2008) A comparison of Bayes-Laplace, Jeffreys, and other priors: the case of zero events. Am Stat 62(1):40\u201344","journal-title":"Am Stat"},{"issue":"1","key":"650_CR60","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00650-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00650-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00650-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T17:19:32Z","timestamp":1644945572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00650-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00650-z","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,22]]},"assertion":[{"value":"5 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}