A parameter-less genetic algorithm with customized crossover and mutation operators

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 901-908

  Nadi, Farhad ^a   Khader, Ahamad Tajudin ^a  

^a SCHOOL OF PHYSICS   (Malaysia)

Author keywords

Crossover rate; Exploitation; Exploration; Genetic algorithms; Mutation rate; Parameter control

Indexed keywords

CROSSOVER AND MUTATION; CROSSOVER RATES; EXPLOITATION; EXPLORATION AND EXPLOITATION; META HEURISTICS; MULTI-MODAL; MUTATION RATES; OTHER ALGORITHMS; PARAMETER CONTROL; PROBABILITY VECTOR;

DNA SEQUENCES; GENES; MATHEMATICAL OPERATORS; PARAMETER ESTIMATION; PROBABILITY;

GENETIC ALGORITHMS;

EID: 84860416489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001700     Document Type: Conference Paper

References (38)

1. J. Arabas, Z. Michalewicz, and J. Mulawka. Gavaps - a genetic algorithm with varying population size. In Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, volume 1, pages 73-78, USA, 1994.
2. T. Bäck, A. E. Eiben, and N. A. L. van der Vaart. An empirical study on gas "without parameters". In PPSN, pages 315-324, 2000.
3. T. Bäck and M. Schutz. Intelligent mutation rate control in canonical genetic algorithms. In Foundations of Intelligent Systems, pages 158-167. 1996. (Pubitemid 126079089)
4. S. Baluja. Population based incremental learning: A method for integrating genetic search based function optimization and competitve learning, 1994.
5. F. H. d. Brito, A. N. Teixeira, O. N. Teixeira, and R. C. L. Oliveira. A fuzzy approach to control genetic algorithm parameters. SADIO Electronic Journal of Informatics and Operations Research, 1(1):12-23, 2007.
6. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, pages 151-158, New York, NY, USA, 1971. ACM.
7. W. de Landgraaf, A. Eiben, and V. Nannen. Parameter Calibration using Meta-Algorithms. In IEEE Congress on Evolutionary Computation, pages 71-78. IEEE, 2007. (Pubitemid 351371384)
8. A. Eiben, M. Schut, and A. de Wilde. Boosting genetic algorithms with (self-) adaptive selection. In Proceedings of the IEEE Conference on Evolutionary Computation (CEC 2006), pages 1584-1589. IEEE, 2006.
9. A. Eiben and J. Smith. Introduction to Evolutionary Computing. Natural Computing Series. Springer, 2 edition, 2007.
10. G. Eiben and M. C. Schut. New ways to calibrate evolutionary algorithms. In Advances in Metaheuristics for Hard Optimization, pages 153-177. 2008.
11. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
12. J. Grefenstette. Optimization of control parameters for genetic algorithms. Systems, Man and Cybernetics, IEEE Transactions on, 16(1):7, 1986.
13. J. Gu. Local search for satisfiability (sat) problem. Systems, Man and Cybernetics, IEEE Transactions on, 23(4):1108-1129, 1993.
14. G. Harik. Linkage learning via probabilistic modeling in the ecga. Technical report, Illinois Genetic Algorithms Laboratory, 1999.
15. G. Harik, F. Lobo, and D. Goldberg. The compact genetic algorithm. In Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, pages 523-528, 4-9 1998.
16. G. R. Harik and F. G. Lobo. A parameter-less genetic algorithm. In I. W. B. e. al., editor, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, pages 258-265, San Francisco, CA, Morgan Kaufmann, 1999.
17. W. E. Hart and R. K. Belew. Optimising an arbitrary function is hard for the genetic algorithm. In R. K. Belew and L. B. Booker, editors, ICGA, pages 190-195. Morgan Kaufmann, 1991.
18. C. Ho, K. Lee, and K. Leung. A genetic algorithm based on mutation and crossover with adaptive probabilities. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 1, pages -775 Vol. 1, 1999.
19. J. Holland. Adaptation in Natural and Artifical Systems. University of Michigan Press, 1975.
20. K. A. D. Jong. Evolutionary computation. a unified approach. 2006.
21. K. A. D. Jong and W. M. Spears. Using genetic algorithms to solve np-complete problems. In J. D. Schaffer, editor, ICGA, pages 124-132. Morgan Kaufmann, 1989.
22. F. G. Lobo and D. E. Goldberg. The parameter-less genetic algorithm in practice. Information Sciences, 167(1-4):217-232, 2004.
23. F. M. P. d. G. Lobo. The Parameter-Less Genetic Algorithm: Rational and Automated Parameter Selection for Simplified Genetic Algorithm Operation. PhD thesis, 1999.
24. E. C.-P. Martin Pelikan, David E. Goldberg. Boa: The bayesian optimization algorithm. In in Proceedings of Genetic and Evolutionary Computation Conference, pages 525-532. Morgan Kaufmann, 1999.
25. S. McClintock, T. Lunney, and A. Hashim. A fuzzy logic controlled genetic algorithm environment. In Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International Conference on, volume 3, pages 2181-2186 vol.3, 1997.
26. H. Mühlenbein, T. Mahnig, and A. O. Rodriguez. Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5:215-247, 1999.
27. Z. Michalewicz. Gas: Selected topics. In Genetic Algorithms + Data Structures = Evolution Programs, page 387. Springer, 1998.
28. V. Nannen, S. K. Smit, and A. E. Eiben. Costs and benefits of tuning parameters of evolutionary algorithms. In Proceedings of the 10th international conference on Parallel Problem Solving from Nature, pages 528-538. Springer-Verlag, Berlin, Heidelberg, 2008.
29. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. IlliGAL Report No. 99018, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, 1999.
30. R. Salomon. The deterministic genetic algorithm: implementation details and some results. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 1, pages -702 Vol. 1, 1999.
31. K. Sastry and D. E. Goldberg. On extended compact genetic algorithm. Technical report, GECCO-2000, late breaking papers, Genetic And Evolutionary Computation Conference, 2000.
32. S. K. Smit and A. E. Eiben. Comparing Parameter Tuning Methods for Evolutionary Algorithms. In IEEE Congress on Evolutionary Computation (CEC), pages 399-406, May 2009.
33. G. Smith. Adaptive genetic algorithms and the boolean satisfiability problem. Technical report, University of Pittsburgh, Pittsburgh, PA, 1979.
34. J. Smith and T. C. Fogarty. Adaptively parameterised evolutionary systems: Self-adaptive recombination and mutation in a genetic algorithm. In PPSN, pages 441-450, 1996. (Pubitemid 126128332)
35. W. M. Spears. Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series). Springer, June 2000.
36. M. Srinivas and L. M. Patnaik. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 24(4):656-667, 1994.
37. F. Vafaee and P. C. Nelson. An explorative and exploitative mutation scheme. In IEEE Congress on Evolutionary Computation, pages 1-8. IEEE, 2010.
38. S. Yang and c. Uyar. Adaptive mutation with fitness and allele distribution correlation for genetic algorithms. In Proceedings of the 2006 ACM symposium on Applied computing, SAC '06, pages 940-944, New York, NY, USA, 2006. ACM. (Pubitemid 44758924)