A robust evolutionary algorithm for global optimization

Engineering Optimization

Volumn 34, Issue 5, 2002, Pages 405-425

  Yang, Jinn Moon ^a   Lin, Chin Jen ^b   Kao, Cheng Yan ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Adaptive rules; Evolutionary algorithms; Family competition; Global optimization; Multiple mutation operators

Indexed keywords

EVOLUTIONARY ALGORITHMS; FUNCTIONS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY;

ADAPTIVE RULES; FAMILY COMPETITION; MULTIPLE MUTATION OPERATORS;

GLOBAL OPTIMIZATION;

EID: 0036752160     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150214019     Document Type: Article

References (35)

1. Bäck, T. (1996). Evolutionary Algorithms in Theory and Practice, Oxford University Press.
2. Bersini, H., Dorigo, M., Langerman, S., Seront, G. and Gamardella, L. (1996). Results of the first international content on evolutionary optimization (1st ICEO). In: Proc. of the IEEE Int. Conf. on Evolutionary Computation, pp. 611-614.
3. De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan.
4. Deb, K. and Agrawal, R. B. (1995). Simulated binary crossover for continuous search space. Complex Systems, 9, 115-148.
5. Deb, K. and Beyer, H.-G. (1999). Self-adaptation in real-parameter genetic algorithms with simulated binary crossover. In: Genetic and Evolutionary Computation Conf. (GECCO-99), pp. 172-179.
6. Deb, K. and Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In: Proc. of the Third International Conf. on Genetic Algorithms, pp. 42-50.
7. Eshelman, L. J. (1991). The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Rawlins, G. J. (Ed.), Foundation of Genetic Algorithms 1. Morgan Kaufmann Publishers, Inc., San Mateo, CA, USA, pp. 265-283.
8. Eshelman, L. J. and Schaffer, J. D. (1993). Crossover's niche. In: Forrest, S. (Ed.), Proc. of the Fifth International Conf. on Genetic Algorithms. Morgan Kaufmann Publishers, Inc., pp. 9-14.
9. Eshelman, J. J. and Schaffer, J. D. (1993). Real-coded genetic algorithms and interval-schemata. In: Whitley, L. D. (Ed.), Foundation of Genetic Algorithms 2. Morgan Kaufmann Publishers, Inc., pp. 187-202.
10. Fogel, D. B. and Atmar, W. (1990). Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biological Cybernetics, 63, 111-114.
11. Fogel, L. J., Owens, A. J. and Walsh, M. J. (1996). Artificial Intelligence Through Simulated Evolution. Wiley, New York.
12. Gordon, V. S. and Whitley, D. (1993). Serial and parallel genetic algorithms as function optimizers, 177-183.
13. Hart, W. E. (1994). Adaptive global optimization with local search. PhD thesis, University of California, San Diego.
14. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI.
15. Janikow, C. Z. and Michalewicz, Z. (1991). An experimental comparison of binary and floating point representations in genetic algorithms. In: Proc. of the Fourth International Conf. on Genetic Algorithms, pp. 31-36.
16. Mathias, K. E. and Whitley, L. D. (1994). Changing representations during search: A comparative study of delta coding. Evolutionary Computation, 2(3), 249-278.
17. Mühlenbein, H. and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm I. Continuous parameters optimization. Evolutionary Computation, 1(1), 24-49.
18. Mühlenbein, H., Schomisch, M. and Born, J. (1991). The parallel genetic algorithm as function optimizer. Parallel Computing, 17, 619-632.
19. Radcliffe, N.J. (1991). Equivalence class analysis of genetic algorithms. Complex Systems, 5(2), 183-206.
20. Rudolph, G. (1997). Local convergence rates of simple evolutionary algorithms with Cauchy mutations. IEEE Trans. on Evolutionary Computation, 1(4), 249-258.
21. Salomon, R. (1996). Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions; a survey of some theoretical and practical aspects of genetic algorithms. BioSystems, 39(3), 263-278.
22. Saravanan, N. and Fogel, D. B. (1997). Multi-operator evolutionary programming: a preliminary on function optimization. In: Angeline, P. J., et al. (Eds.), Proc. of the 6th Annu. Conf. on Evolutionary Programming (Lectures Notes in Computer Science, 1213), pp. 215-222.
23. Schwefel, H.-P. (1981). Numerical Optimization of Computer Models. Wiley, Chichester.
24. Snyman, J. A. and Fatti, L. P. (1987). A multi-start global minimization algorithm with dynamic search trajectories. Journal of Optimization Theory and Applications, 54(1), 121-142.
25. Törn, A. and Žilinskas, A. (1989). Global Optimization, Lecture Notes in Computer Science, Vol. 350, Springer-Verlag.
26. Whitley, D., Mathias, K., Rana, S. and Dzubera, J. (1995). Building better test functions. In: Proc. of the Sixth Int. Conf. on Genetic Algorithms, pp. 239-246.
27. Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Trans. on Evolutionary Computation, 1, 67-82.
28. Xiao, J., Michalewicz, Z., Zhang, L. and Trojanowski, K. (1997). Adaptive evolutionary planner/navigator for mobile robots. IEEE Trans. on Evolutionary Computation, 1(1), 18-28.
29. Yang, J.-M., Chen, Y.-P., Horng, J.-T. Kao, C.-Y. (1997). Applying family competition to evolution strategies for constrained optimization. In: Angeline, P.J., Reynolds, R. G., McDonnell, J. R. and Eberhart, R. (Eds.), Lecture Notes in Computer Science, Vol. 1213, 201-211.
30. Yang, J.-M., Kao, C.-Y. and Horng, J. T. (1997). A continuous genetic algorithm for global optimization. In: Proc. of the Seventh Int. Conf. on Genetic Algorithms, pp. 230-237.
31. Yang, J.-M., Kao, C.-Y. and Horng, J.-T. (1998). A new evolutionary approach to developing neural autonomous agents. In: IEEE Int. Conf. on Robotics and Automation, pp. 1411-1416.
32. Yao, X. and Liu, Y. (1996). Fast evolutionary programming. In: Proc. of the Fifth Annual Conf. on Evolutionary Programming, pp. 461-460.
33. Yao, X. and Liu, Y. (1997). Fast evolution strategies. In: Angeline, P.J., Reynolds, R. G., McDonnell, J. R. and Eberhart, R. (Eds.), Proc. of the 6th Annu. Conf. on Evolutionary Programming (Lecture Notes in Computer Science, 1213), pp. 151-161.
34. Yen, J., Liao, J. C., Lee, B. and Randoph, D. (1998). A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method. IEEE Trans. on Systems, Man, and Cybernetics - Part B, 28(2), 173-191.
35. Yip, P. P. C. and Pao, Y. H. (1995). Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans. on Neural Networks, 6(2), 290-195.