Non-uniform mutation rates for problems with unknown solution lengths

FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI

Volumn , Issue , 2011, Pages 173-180

  Cathabard, Stephan ^a   Lehre, Per Kristian ^b   Yao, Xin ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STRINGS; CANDIDATE SOLUTION; GEOMETRIC DISTRIBUTION; MUTATION OPERATORS; NON-UNIFORM MUTATION; OPTIMAL SOLUTIONS; OPTIMISATIONS; RUNTIMES; SOLUTION SPACE;

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; REAL VARIABLES; SOFTWARE ENGINEERING;

PROBLEM SOLVING;

EID: 79956003267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967670     Document Type: Conference Paper

References (17)

1. Karnig Agop Derderian, Robert Mark Hierons, Mark Harman, and Qiang Guo. Automated unique input output sequence generation for conformance testing of FSMs. The Computer Journal, 49(3):331-344, 2006.
2. Benjamin Doerr and Leslie Ann Goldberg. Adaptive drift analysis. In Proceedings of Parallel Problem Solving from Nature - (PPSN XI), pages 32-41, 2010.
3. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges. Optimizing monotone functions can be difficult. In Proceedings of the 11th international conference on Parallel problem solving from nature: Part I, PPSN'10, pages 42-51, Berlin, Heidelberg, 2010. Springer-Verlag.
4. Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276:51-81, 2002.
5. Stefan Droste, Thomas Jansen, and Ingo Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4):525-544, 2006. (Pubitemid 43876884)
6. Mark Harman, S. Afshin Mansouri, and Yuanyuan Zhang. Search based software engineering: A comprehensive analysis and review of trends techniques and applications. Technical Report TR-09-03, Department of Computer Science, King's College London, 2009.
7. R. Hinterding, Z. Michalewicz, and A.E. Eiben. Adaptation in evolutionary computation: a survey. In Evolutionary Computation, 1997., IEEE International Conference on, pages 65 -69, April 1997.
8. Thomas Jansen and Ingo Wegener. On the choice of the mutation probability for the (1+1) EA. In PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, pages 89-98, London, UK, 2000. Springer-Verlag.
9. David Lee and Mihalis Yannakakis. Testing finite-state machines: state identification and verification. IEEE Transactions on Computers, 43(3):306-320, 1994.
10. David Lee and Mihalis Yannakakis. Principles and methods of testing finite state machines-a survey. Proceedings of the IEEE, 84(8):1090-1123, 1996. (Pubitemid 126752579)
11. Per Kristian Lehre. Negative drift in populations. In Proceedings of Parallel Problem Solving from Nature - (PPSN XI), volume 6238 of LNCS, pages 244-253. Springer Berlin/Heidelberg, 2011.
12. Per Kristian Lehre and Xin Yao. On the impact of the mutation-selection balance on the runtime of evolutionary algorithms. In FOGA'09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pages 47-58, New York, NY, USA, 2009. ACM.
13. Per Kristian Lehre and Xin Yao. Runtime analysis of the (1+1) EA on computing unique input output sequences. Information Sciences, In Press., 2010.
14. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA, 2005.
15. Jim Smith and T.C. Fogarty. Self adaptation of mutation rates in a steady state genetic algorithm, 1996.
16. Dirk Thierens. Adaptive mutation rate control schemes in genetic algorithms. In Proceedings of the 2002 IEEE World Congress on Computational Intelligence: Congress on Evolutionary Computation, pages 980-985. IEEE Press, 2002.
17. B A Trakhtenbrot. Finite automata; behavior and synthesis. American Elsevier, 1973.