{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:08:56Z","timestamp":1766732936206},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,16]],"date-time":"2011-02-16T00:00:00Z","timestamp":1297814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00180-011-0237-5","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T13:28:33Z","timestamp":1297776513000},"page":"303-319","source":"Crossref","is-referenced-by-count":12,"title":["Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing"],"prefix":"10.1007","volume":"26","author":[{"given":"M.","family":"Maucher","sequence":"first","affiliation":[]},{"given":"U.","family":"Sch\u00f6ning","sequence":"additional","affiliation":[]},{"given":"H. A.","family":"Kestler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,16]]},"reference":[{"key":"237_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"237_CR2","doi-asserted-by":"crossref","unstructured":"Canni\u00e8re CD, Preneel B (2006) Trivium: a stream cipher construction inspired by block cipher design principles. In: Backes M, Gritzalis S, Preneel B (eds) Information security: 9th international conference, vol LNCS 4176. Springer, pp 171\u2013186","DOI":"10.1007\/11836810_13"},{"key":"237_CR3","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman S, Geman D (1984) Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell 6: 721\u2013741","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"237_CR4","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"},{"issue":"4","key":"237_CR5","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1063\/1.1150518","volume":"71","author":"T Jennewein","year":"2000","unstructured":"Jennewein T, Achleitner U, Weihs G, Weinfurter H, Zeilinger A (2000) A fast and compact quantum random number generator. Rev Sci Instrum 71(4): 1675\u20131680","journal-title":"Rev Sci Instrum"},{"key":"237_CR6","doi-asserted-by":"crossref","unstructured":"Karloff H, Raghavan P (1988) Randomized algorithms and pseudorandom numbers. In: STOC \u201988: Proceedings of the twentieth annual ACM symposium on theory of computing. ACM, New York, pp 310\u2013321","DOI":"10.1145\/62212.62242"},{"key":"237_CR7","doi-asserted-by":"crossref","unstructured":"Kimura S, Matsumura K (2005) Genetic algorithms using low-discrepancy sequences. In: GECCO \u201905: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, New York, NY, USA, pp 1341\u20131346","DOI":"10.1145\/1068009.1068225"},{"issue":"4598","key":"237_CR8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598): 671\u2013680","journal-title":"Science"},{"key":"237_CR9","unstructured":"Knuth DE (1997) Art of computer programming, vol 2: seminumerical algorithms (3rd Ed). Addison"},{"key":"237_CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/9783527628025.ch17","volume-title":"Mathematical analysis of evolution, information, and complexity","author":"B List","year":"2009","unstructured":"List B, Maucher M, Sch\u00f6ning U, Schuler R (2009) Quicksort from an information theoretic view. In: Arendt W, Schleich WP (eds) Mathematical analysis of evolution, information, and complexity. Wiley, Berlin, pp 455\u2013464"},{"key":"237_CR11","unstructured":"Marsaglia G (1995) The Marsaglia random number CDROM including the Diehard battery of tests of randomness. http:\/\/stat.fsu.edu\/pub\/diehard\/"},{"key":"237_CR12","first-page":"219","volume-title":"Parallel problem solving from nature","author":"K Mathias","year":"1992","unstructured":"Mathias K, Whitley D (1992) Genetic operators, the fitness landscape and the traveling salesman problem. In: Manner R, Manderick B (eds) Parallel problem solving from nature. Elsevier, Amsterdam, pp 219\u2013228"},{"issue":"1","key":"237_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1): 3\u201330","journal-title":"ACM Trans Model Comput Simul"},{"issue":"6","key":"237_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6): 1087\u20131092","journal-title":"J Chem Phys"},{"key":"237_CR15","unstructured":"Meysenburg MM (1997) The effect of pseudo-random number generator quality on the performance of a simple genetic algorithm. Master\u2019s thesis, University of Idaho"},{"key":"237_CR16","unstructured":"Meysenburg MM, Foster JA (1997) The quality of pseudorandom number generators and simple genetic algorithm performance. In: Proceedings of the 7th international conference on genetic algorithms, pp 276\u2013281"},{"key":"237_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"237_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970081","volume-title":"Random number generation and quasi-monte carlo methods","author":"H Niederreiter","year":"1992","unstructured":"Niederreiter H (1992) Random number generation and quasi-monte carlo methods. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"237_CR19","unstructured":"R Development Core Team (2008) R: a language and environment for statistical computing. http:\/\/www.R-project.org"},{"key":"237_CR20","volume-title":"Evolutionsstrategie: optimierung technischer systeme nach prinzipien der biologischen evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg I (1973) Evolutionsstrategie: optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann, Stuttgart"},{"key":"237_CR21","unstructured":"Reinelt G (1994) The traveling salesman: computational solutions for TSP applications, Lecture notes in computer science (LNCS), vol 840. Springer, Berlin"},{"key":"237_CR22","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718300","volume-title":"Facts, conjectures, and improvements for simulated annealing","author":"P Salamon","year":"2002","unstructured":"Salamon P, Frost R, Sibani P (2002) Facts, conjectures, and improvements for simulated annealing. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"237_CR23","unstructured":"Tompkins DAD, Hoos HH (2006) On the quality and quantity of random decisions in stochastic local search for sat. In: Lamontagne L, Marchand M (eds) Canadian conference on AI. Lecture notes in computer science, vol 4013. Springer, pp 146\u2013158"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-011-0237-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-011-0237-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-011-0237-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:22:37Z","timestamp":1637281357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-011-0237-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,16]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s00180-011-0237-5","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,16]]}}}