A new mutation operator for real coded genetic algorithms

Applied Mathematics and Computation

Volumn 193, Issue 1, 2007, Pages 211-230

  Deep, Kusum ^a   Thakur, Manoj ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

Author keywords

Genetic algorithms; Global optimization; Real coded mutation operator

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; LAPLACE EQUATION;

LAPLACE CROSSOVER; POWER MUTATION; REAL CODED MUTATION OPERATOR;

MATHEMATICAL OPERATORS;

EID: 35248899970     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.03.046     Document Type: Article

References (43)

1. Back T., and Schwefel H.-P. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation 1 1 (1993) 1-23
2. K.A. De-Jong, An analysis of the behavior of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, 1975.
3. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley, New York
4. Goldberg D.E. Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Systems 5 2 (1991) 139-168
5. Janikow C.Z., and Michalewicz Z. An experimental comparison of binary and floating point representation in genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms (1991), Morgan Kaufmann, San Francisco 31-36
6. Ono I., and Kobayashi S. A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: Back T. (Ed). Proceedings of the Seventh International Conference on Genetic Algorithms (1997), Morgan Kaufmann, San Mateo, CA 246-253
7. S. Tsutsui, M. Yamamura, T. Higuchi, Multi-parent recombination with simplex crossover in real-coded genetic algorithms, in: W. Banzhaf, J. Daida, A. Eiben, M. Garzon, V. Honavar, M. Jakiela, R. Smith (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1 1999), 1999, pp. 657-664.
8. H. Kita, I. Ono, S. Kobayashi, The multi-parent unimodal normal distribution crossover for real-coded genetic algorithms, in: Proceedings of the 1999 Congress on Evolutionary Computation, IEEE, vol. 2, 1999, pp. 1588-1595.
9. Deb K., Anand A., and Joshi D. A computationally efficient evolutionary algorithm for real-parameter evolution. Evolutionary Computation Journal 10 4 (2002) 371-395
10. A. Sinha, S. Tiwari, K. Deb, A population based steady state procedure for real parameter optimization. KANGAL Technical Report no. 2005004, 2005.
11. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (1992), Springer-Verlag, New York
12. Eshelman L.J., and Schaffer J.D. Real-coded genetic algorithms and interval schemata. In: Whitley D.L. (Ed). Foundation of Genetic Algorithms II (1993), Morgan Kaufmann, San Mateo, CA 187-202
13. Radcliffe N.J. Equivalence class analysis of genetic algorithms. Complex Systems 2 5 (1991) 183-205
14. Muhlebein H., and Schlierkamp-Voosen D. Predictive models for breeder genetic algorithms in continuous parameter optimization. Evolutionary Computation 1 1 (1993) 25-49
15. Voigt H.M., Muhlenbein H., and Cvetkovic D. Fuzzy recombination for the breeder genetic algorithms. In: Eshelmen L.J. (Ed). Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann, San Mateo, CA 104-111
16. Wright A.H. Genetic algorithms for real parameter optimization. In: Rawlins G.J.E. (Ed). Foundations of Genetic Algorithms I (1991), Morgan Kaufmann, San Mateo 205-218
17. F. Herrera, M Lozano, Adaptation of genetic algorithm parameters based on fuzzy logic controllers, in: Genetic Algorithms and Soft Computing, 1996.
18. Herrera F., Lozano M., and Verdegay J.L. Dynamic and heuristic fuzzy connectives based crossover operators for controlling the diversity and convergence of real-coded genetic algorithms. International Journal Intelligent System 2 (1999) 1013-1041
19. Deb K., and Agrawal R.B. Simulated binary crossover for continuous search space. Complex Systems 9 (1995) 115-148
20. Ling S.H., and Leung F.H.F. An improved genetic algorithm with average-bound crossover and wavelet mutation operations. Soft Computing 11 (2007) 7-31
21. Kusum Deep, Manoj Thakur, A new crossover operator for real coded genetic algorithms, Applied Mathematics and Computations, accepted for publication, doi:10.1016/j.amc.2006.10.047.
22. Makinen R.A.E., Periaux J., and Toivanen J. Multidisciplinary shape optimization in aerodynamics and electromagnetic using genetic algorithms. International Journal for Numerical Methods in Fluids 30 2 (1999) 149-159
23. Spears W.M. Crossover or mutation?. In: Whitley L.D. (Ed). Foundations of Genetic Algorithms 2 (1993), Morgan Kaufmann, San Mateo, CA 221-238
24. Herrera F., and Lozano M. Two-Loop real coded genetic algorithms with adaptive control of mutation step sizes. Applied Intelligence 13 (2002) 187-204
25. Smith J.E., and Fogarty T.C. Operators and parameter adaptation in genetic algorithms. Soft computing 1 2 (1997) 81-87
26. Krasnogor N., and Smith J.E. Emergence of profitable search strategies based on a simple inheritance mechanism. Proceedings of the International Conference on Genetic and Evolutionary Computations (2001), Morgan Kaufmann, San Mateo, CA 432-439
27. J.E. Smith, Modelling GAs with self adapting mutation rates, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2001.
28. Michalewicz Z., and Schoenauer M. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation 4 1 (1996) 1-32
29. Muhelenbein H., and Schlierkamp-Voosen D. Predictive models for the breeder genetic algorithm 1, continuous parameter optimization. Evolutionary Computations 1 (1993) 25-49
30. H.M. Voigt, T. Anheyer, Modal mutations in evolutionary algorithms 1994, in: Proceedings of the First IEEE Conference on Evolutionary Computation, 1994, pp. 88-92.
31. Hinterding R. Gaussian mutation and self-adaption in numeric genetic algorithms. Proceedings of Second IEEE Conference Evolutionary Computation (1995), IEEE Press, Piscataway, NJ 384-389
32. Hinterding R., Michalewicz Z., and Peachey T.C. Self-adaptive genetic algorithm for numeric functions. In: Voigt H.-M., Ebeling W., Rechenberg I., and Schwefel H.-P. (Eds). Proceedings of the Fourth Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science vol. 1141 (1996), Springer, Berlin, Germany 420-429
33. A. Berry, P. Vamplew, PoD can mutate: a simple dynamic directed mutation approach for genetic algorithms, in: Proceedings of AISAT2004: International Conference on Artificial Intelligence in Science and Technology, Hobart, Tasmania, 2004.
34. Temby L., Vamplew P., and Berry A. Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum. Lecture Notes in Computer Science 3809 (2005), Springer-Verlag pp. 1108-1111
35. Munteanu C., and Lazarescu C. Improving mutation capabilities in a real-coded GA. Proceedings of GoIASP'99. Lecture Notes in Computer Science 1596 (1999), Springer-Verlag 138-148
36. Deb K. Muiti-objective Optimization Using Evolutionary Algorithms (2001), Wiley, Chichester
37. Michalewicz Z., Logan T., and Swaminathan S. Evolutionary operators for continuous convex parameter space. In: Sebald A.V., and Fogel L.J. (Eds). Proceeding of Third Annual Conference on Evolutionary Programming (1994), World Scientific, River Edge, NJ 84-97
38. Michalewicz Z. Genetic algorithms, numerical optimization and constraints. In: Eshelmen L.J. (Ed). Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann, San Mateo, CA 151-158
39. Michalewicz Z., Dasgupta D., Le Riche R.G., and Schoenauer M. Evolutionary algorithms for constrained engineering problems. Computers & Industrial Engineering Journal 30 4 (1996) 851-870
40. Meittinen K., Makela M.M., and Toivanen J. Numerical comparison of some penalty based constraint handling techniques in genetic algorithms. Journal of Global Optimization 27 (2003) 427-446
41. Maaranen H., Meittinen K., and Makela M.M. Quasi random initial population for genetic algorithms. Computer and Mathematics with Applications 47 (2004) 1885-1895
42. Bharti, Controlled random search technique and their applications. Ph.D. Thesis. Department of Mathematics, University of Roorkee, Roorkee, India, 1994.
43. Mohan C., and Nguyen H.T. A controlled random search technique incorporating the simulating annealing concept for solving integer and mixed integer global optimization problems. Computational Optimization and Applications 14 (1999) 103-132