Search heuristics and the influence of non-perfect randomness: Examining Genetic Algorithms and Simulated Annealing

Computational Statistics

Volumn 26, Issue 2, 2011, Pages 303-319

  Maucher, M ^a   Schoning U ^a   Kestler, H A ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Genetic algorithms; Pseudorandom number generators; Quasi random numbers; Simulated annealing

Indexed keywords

EID: 79955468978     PISSN: 09434062     EISSN: 16139658     Source Type: Journal    
DOI: 10.1007/s00180-011-0237-5     Document Type: Article

References (23)

1. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford.
2. Cannière 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-186.
3. Geman S, Geman D (1984) Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell 6: 721-741.
4. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor.
5. 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-1680.
6. Karloff H, Raghavan P (1988) Randomized algorithms and pseudorandom numbers. In: STOC '88: Proceedings of the twentieth annual ACM symposium on theory of computing. ACM, New York, pp 310-321.
7. Kimura S, Matsumura K (2005) Genetic algorithms using low-discrepancy sequences. In: GECCO '05: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, New York, NY, USA, pp 1341-1346.
8. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598): 671-680.
9. Knuth DE (1997) Art of computer programming, vol 2: seminumerical algorithms (3rd Ed). Addison.
10. List B, Maucher M, Schöning 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-464.
11. Marsaglia G (1995) The Marsaglia random number CDROM including the Diehard battery of tests of randomness. http://stat. fsu. edu/pub/diehard/.
12. 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-228.
13. Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1): 3-30.
14. 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-1092.
15. Meysenburg MM (1997) The effect of pseudo-random number generator quality on the performance of a simple genetic algorithm. Master's thesis, University of Idaho.
16. 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-281.
17. Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge.
18. Niederreiter H (1992) Random number generation and quasi-monte carlo methods. Society for Industrial and Applied Mathematics, Philadelphia.
19. R Development Core Team (2008) R: a language and environment for statistical computing. http://www. R-project. org.
20. Rechenberg I (1973) Evolutionsstrategie: optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann, Stuttgart.
21. Reinelt G (1994) The traveling salesman: computational solutions for TSP applications, Lecture notes in computer science (LNCS), vol 840. Springer, Berlin.
22. Salamon P, Frost R, Sibani P (2002) Facts, conjectures, and improvements for simulated annealing. Society for Industrial and Applied Mathematics, Philadelphia.
23. 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-158.