{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T19:33:12Z","timestamp":1785871992216,"version":"3.56.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00500-014-1493-4","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T09:33:16Z","timestamp":1415007196000},"page":"223-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":64,"title":["Is a comparison of results meaningful from the inexact replications of computational experiments?"],"prefix":"10.1007","volume":"20","author":[{"given":"Matej","family":"\u010crepin\u0161ek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shih-Hsi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luka","family":"Mernik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marjan","family":"Mernik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,11,1]]},"reference":[{"key":"1493_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck T, Schwefel H-P (1993) An overview of evolutionary algorithms for parameter optimization. Evol Comput 1:1\u201323","journal-title":"Evol Comput"},{"key":"1493_CR2","unstructured":"B\u00e4ck T, Eiben AE, van der Vaart NAL (2000) An empirical study on gas without parameters. In: Proceedings of the 6th international conference on parallel problem solving from nature, pp 315\u2013324"},{"key":"1493_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"RS Barr","year":"1995","unstructured":"Barr RS, Golden BL, Kelly JP, Resende MGC, Stewart WR Jr (1995) Designing and reporting on computational experiments with heuristic methods. J Metaheuristics 1:9\u201332","journal-title":"J Metaheuristics"},{"key":"1493_CR4","doi-asserted-by":"crossref","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. ACM Comput Surv 35:268\u2013308","journal-title":"ACM Comput Surv"},{"key":"1493_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1504\/IJICA.2011.037947","volume":"3","author":"M \u010crepin\u0161ek","year":"2011","unstructured":"\u010crepin\u0161ek M, Mernik M, Liu SH (2011) Analysis of exploration and exploitation in evolutionary algorithms by ancestry trees. Int J Innov Comput Appl 3:11\u201319","journal-title":"Int J Innov Comput Appl"},{"key":"1493_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ins.2012.05.009","volume":"212","author":"M \u010crepin\u0161ek","year":"2012","unstructured":"\u010crepin\u0161ek M, Liu SH, Mernik L (2012) A note on teaching-learning-based optimization algorithm. Inf Sci 212:79\u201393","journal-title":"Inf Sci"},{"key":"1493_CR7","doi-asserted-by":"crossref","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45:1\u201333 (article 35)","DOI":"10.1145\/2480741.2480752"},{"key":"1493_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"1493_CR9","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3:124\u2013141","journal-title":"IEEE Trans Evol Comput"},{"key":"1493_CR10","doi-asserted-by":"crossref","unstructured":"Eiben AE, Marchiori E, Valk\u00f3 VA (2004) Evolutionary algorithms with on-the-fly population size adjustment. In: Newblock parallel problem solving from nature, vol VIII, pp 41\u201350","DOI":"10.1007\/978-3-540-30217-9_5"},{"key":"1493_CR11","unstructured":"Eiben AE, Smith JE (2008) Introduction to evolutionary computing. Springer, New York"},{"key":"1493_CR12","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.asoc.2009.08.001","volume":"10","author":"I Fister","year":"2010","unstructured":"Fister I, Mernik M, Filipi\u010d B (2010) A hybrid self-adaptive evolutionary algorithm for marker optimization in the clothing industry. Appl Soft Comput 10:527\u2013548","journal-title":"Appl Soft Comput"},{"key":"1493_CR13","first-page":"2010","volume":"7215","author":"N Hansen","year":"2010","unstructured":"Hansen N, Auger A, Finck S, Ros R (2010) Experimental setup. INRIA Res Rep RR 7215:2010","journal-title":"INRIA Res Rep RR"},{"key":"1493_CR14","unstructured":"Harik GR, Lobo F (1999) A parameter-less genetic algorithm. In: Technical report, University of Illinois at Urbana-Champaign"},{"key":"1493_CR15","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.asoc.2011.11.024","volume":"12","author":"D Hrn\u010di\u010d","year":"2012","unstructured":"Hrn\u010di\u010d D, Mernik M, Bryant BR, Javed F (2012) A memetic grammar inference algorithm for language learning. Appl Soft Comput 12:1006\u20131020","journal-title":"Appl Soft Comput"},{"key":"1493_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol Comput 1:61\u201370","journal-title":"Swarm Evol Comput"},{"key":"1493_CR17","doi-asserted-by":"crossref","unstructured":"Johnson DS (2002) A theoretician\u2019s guide to the experimental analysis of algorithms. In: Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges, pp 215\u2013250","DOI":"10.1090\/dimacs\/059\/11"},{"key":"1493_CR18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00500-013-1060-4","volume":"18","author":"Y Li","year":"2014","unstructured":"Li Y, Liu J, Liu C (2014) A comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks. Soft Comput 18:329\u2013348","journal-title":"Soft Comput"},{"key":"1493_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1142\/9789814295062_0029","volume":"13","author":"S-H Liu","year":"2009","unstructured":"Liu S-H, Mernik M, Bryant BR (2009) To explore or to exploit: an entropy-driven approach for evolutionary algorithms. Int J Knowl Based Intell Eng Syst 13:185\u2013206","journal-title":"Int J Knowl Based Intell Eng Syst"},{"key":"1493_CR20","doi-asserted-by":"crossref","first-page":"3792","DOI":"10.1016\/j.asoc.2013.05.010","volume":"13","author":"S-H Liu","year":"2013","unstructured":"Liu S-H, Mernik M, Hrn\u010di\u010d D, \u010crepin\u0161ek M (2013) A parameter control method of evolutionary algorithms using exploration and exploitation measures with a practical application for fitting Sovova\u2019s mass transfer model. Appl Soft Comput 13:3792\u20133805","journal-title":"Appl Soft Comput"},{"key":"1493_CR21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/337885.337899","volume":"30","author":"CC McGeoch","year":"1999","unstructured":"McGeoch CC, Moret BME (1999) How to present a paper on experimental work with algorithms. SIGACT News 30:85\u201390","journal-title":"SIGACT News"},{"key":"1493_CR22","doi-asserted-by":"crossref","unstructured":"Mlakar M, Petelin D, Tu\u0161ar T, Filipi\u010d B (2014) GP-DEMO: differential evolution for multiobjective optimization based on Gaussian process models. Eur J Oper Res. doi: 10.1016\/j.ejor.2014.04.011 (in press)","DOI":"10.1016\/j.ejor.2014.04.011"},{"key":"1493_CR23","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.asoc.2011.08.047","volume":"12","author":"D Mongus","year":"2012","unstructured":"Mongus D, Repnik B, Mernik M, \u017dalik B (2012) A hybrid evolutionary algorithm for tuning a cloth-simulation model. Appl Soft Comput 12:266\u2013273","journal-title":"Appl Soft Comput"},{"key":"1493_CR24","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1007\/s00500-013-1022-x","volume":"17","author":"P Novoa-Hernandez","year":"2013","unstructured":"Novoa-Hernandez P, Cruz Corona C, Pelta DA (2013) Self-adaptive, multipopulation differential evolution in dynamic environments. Soft Comput 17:1861\u20131881","journal-title":"Soft Comput"},{"key":"1493_CR25","doi-asserted-by":"crossref","unstructured":"Papa G (2008) Parameter-less evolutionary search. In: Proceedings of genetic and evolutionary computation conference, pp 1133\u20131134","DOI":"10.1145\/1389095.1389314"},{"key":"1493_CR26","doi-asserted-by":"crossref","unstructured":"Papa G, Vuka\u0161inovi\u010d V, Koro\u0161ec P (2012) Guided restarting local search for production planning. Eng Appl Artif Intell 25:242\u2013253","DOI":"10.1016\/j.engappai.2011.07.001"},{"key":"1493_CR27","doi-asserted-by":"crossref","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43:303\u2013315","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"1493_CR28","doi-asserted-by":"crossref","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2012) Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183:1\u201315","DOI":"10.1016\/j.ins.2011.08.006"},{"key":"1493_CR29","first-page":"535","volume":"3","author":"RV Rao","year":"2012","unstructured":"Rao RV, Patel V (2012) An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems. Int J Ind Eng 3:535\u2013560","journal-title":"Int J Ind Eng"},{"key":"1493_CR30","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.engappai.2012.06.007","volume":"26","author":"RV Rao","year":"2013","unstructured":"Rao RV, Kalyankar VD (2013) Parameter optimization of modern machining process using teaching-learning-based optimization algorithm. Eng Appl Artif Intell 26:524\u2013531","journal-title":"Eng Appl Artif Intell"},{"key":"1493_CR31","unstructured":"Simon D (2013) Evolutionary optimization algorithms. Wiley, New Jersey"},{"key":"1493_CR32","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ins.2012.09.030","volume":"221","author":"C Sun","year":"2013","unstructured":"Sun C, Zeng J, Pan J, Xue S, Jin Y (2013) A new fitness estimation strategy for particle swarm optimization. Inf Sci 221:355\u2013370","journal-title":"Inf Sci"},{"key":"1493_CR33","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.ins.2014.02.154","volume":"277","author":"N Ve\u010dek","year":"2014","unstructured":"Ve\u010dek N, Mernik M, \u010crepin\u0161ek M (2014) A chess rating system for evolutionary algorithms - a new method for the comparison and ranking of evolutionary algorithms. Inf Sci 277:656\u2013679","journal-title":"Inf Sci"},{"key":"1493_CR34","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ins.2012.11.009","volume":"229","author":"G Waghmare","year":"2013","unstructured":"Waghmare G (2013) Comments on \u201ca note on teaching-learning-based optimisation algorithm\u201d. Inf Sci 229:159\u2013169","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1493-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1493-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1493-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T23:24:25Z","timestamp":1565997865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1493-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1493"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1493-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,1]]}}}