{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T18:14:25Z","timestamp":1661537665724},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2015,4,14]],"date-time":"2015-04-14T00:00:00Z","timestamp":1428969600000},"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":[[2015,10]]},"DOI":"10.1007\/s00500-015-1672-y","type":"journal-article","created":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T02:44:19Z","timestamp":1428893059000},"page":"2717-2734","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the statistical distribution of the expected run-time in population-based search algorithms"],"prefix":"10.1007","volume":"19","author":[{"given":"David F.","family":"Barrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Camacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda D.","family":"R-Moreno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,14]]},"reference":[{"key":"1672_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R Barr","year":"1995","unstructured":"Barr R, Golden B, Kelly J, Resende M, Stewart W (1995) Designing and reporting on computational experiments with heuristic methods. J Heuristics 1:9\u201332","journal-title":"J Heuristics"},{"key":"1672_CR2","doi-asserted-by":"crossref","unstructured":"Barrero DF, Camacho D, R-Moreno MD (2010) Confidence intervals of success rates in evolutionary computation. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, GECCO \u201910, pp 975\u2013976. ACM, Portland. doi: 10.1145\/1830483.1830657","DOI":"10.1145\/1830483.1830657"},{"key":"1672_CR3","unstructured":"Barrero DF, Casta\u00f1o B, R-Moreno MD, Camacho D (2011) Statistical distribution of generation-to-success in GP: application to model accumulated success probability. In: Silva S, Foster JA, Nicolau M, Giacobini M, Machado P (eds) Proceedings of the 14th European conference on genetic programming, EuroGP 2011. LNCS, vol 6621, pp 155\u2013166. Springer, Turin (2011)"},{"key":"1672_CR4","unstructured":"Chiarandini M, St\u00fctzle T (2002) Experimental evaluation of course timetabling algorithms. In: Technical report AIDA-02-05, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt"},{"key":"1672_CR5","doi-asserted-by":"crossref","unstructured":"Eiben AE, Smith JE (2009) Introduction to evolutionary computing. Chapter: Working with evolutionary algorithms, pp 241\u2013258. Springer, New York","DOI":"10.1007\/978-3-662-05094-1_14"},{"key":"1672_CR6","unstructured":"Epstein S, Yun X (2010) From unsolvable to solvable: an exploration of simple changes. In: Workshops at the 24th AAAI conference on artificial intelligence"},{"key":"1672_CR7","doi-asserted-by":"crossref","unstructured":"Feo T, Resende M, Smith S (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 860\u2013878","DOI":"10.1287\/opre.42.5.860"},{"key":"1672_CR8","unstructured":"Frost D, Rish I, Vila L (1997) Summarizing CSP hardness with continuous probability distributions. In: Proceedings of the 14th national conference on artificial intelligence and 9th conference on innovative applications of artificial intelligence, AAAI conference on artificial intelligence, pp 327\u2013333. AAAI Press, New York"},{"key":"1672_CR9","doi-asserted-by":"crossref","unstructured":"Gagliolo M, Legrand C (2010) Experimental methods for the analysis of optimization algorithms. Chapter: Algorithm survival analysis, pp 161\u2013184. Springer, New York","DOI":"10.1007\/978-3-642-02538-9_7"},{"key":"1672_CR10","unstructured":"Hoos H, St\u00fctzle T (1998) Characterizing the run-time behavior of stochastic local search. In: Proceedings of the AAAI conference on artificial intelligence"},{"key":"1672_CR11","doi-asserted-by":"crossref","unstructured":"Hoos H, St\u00fctzle T (1998) Evaluating Las Vegas algorithms\u2014pitfalls and remedies. In: Proceedings of the 14th conference on uncertainty in artificial intelligence (UAI-98), pp 238\u2013245. Morgan Kaufmann, Madison","DOI":"10.1007\/978-3-7091-6492-1_54"},{"issue":"1\u20132","key":"1672_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H Hoos","year":"1999","unstructured":"Hoos H, St\u00fctzle T (1999) Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif Intell 112(1\u20132):213\u2013232","journal-title":"Artif Intell"},{"issue":"4","key":"1672_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H Hoos","year":"2000","unstructured":"Hoos H, St\u00fctzle T (2000) Local search algorithms for SAT: an empirical evaluation. J Autom Reason 24(4):421\u2013481","journal-title":"J Autom Reason"},{"key":"1672_CR14","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"J Koza","year":"1992","unstructured":"Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambrige"},{"key":"1672_CR15","volume-title":"Genetic programming II: automatic discovery of reusable programs","author":"JR Koza","year":"1994","unstructured":"Koza JR (1994) Genetic programming II: automatic discovery of reusable programs. MIT Press, Cambridge"},{"issue":"5","key":"1672_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1641\/0006-3568(2001)051[0341:LNDATS]2.0.CO;2","volume":"51","author":"E Limpert","year":"2001","unstructured":"Limpert E, Stahel WA, Abbt M (2001) Log-normal distributions across the sciences: keys and clues. BioScience 51(5):341\u2013352","journal-title":"BioScience"},{"key":"1672_CR17","unstructured":"Luke S (2001) When short runs beat long runs. In: Proceedings of the genetic and evolutionary computation conference, pp 74\u201380. Morgan Kaufmann, San Francisco"},{"key":"1672_CR18","unstructured":"McDermott J, De Jong K, OReilly UM, White DR, Luke S, Manzoni L, Castelli M, Vanneschi L, Jaskowski W, Krawiec K et al. (2012) Genetic programming needs better benchmarks, p 791. ACM Press, Philadelphia. http:\/\/dl.acm.org\/citation.cfm?id=2330163.2330273"},{"key":"1672_CR19","unstructured":"Paterson N, Livesey M (2000) Performance comparison in genetic programming. In: Late breaking papers at the 2000 genetic and evolutionary computation conference, Las Vegas, pp 253\u2013260"},{"key":"1672_CR20","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Rosseti I, Vallejos R (2009) On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: Proceedings of the second international workshop on engineering stochastic local search algorithms., designing, implementing and analyzing effective heuristics, SLS \u201909, pp 16\u201330. Springer, Berlin","DOI":"10.1007\/978-3-642-03751-1_2"},{"key":"1672_CR21","unstructured":"St\u00fctzle T, Hoos H (1999) Analyzing the run-time behaviour of iterated local search for the TSP. In: III Metaheuristics international conference. Kluwer Academic, Angra dos Reis"},{"key":"1672_CR22","first-page":"309","volume":"22","author":"EB Wilson","year":"1927","unstructured":"Wilson EB (1927) Probable inference, the law of succession, and statistical inference. J Am Stat Assoc 22:309\u2013316","journal-title":"J Am Stat Assoc"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1672-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1672-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1672-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T06:05:00Z","timestamp":1566540300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1672-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,14]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["1672"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1672-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,14]]}}}