Browse > Article

Evolutionary Programming of Applying Estimated Scale Parameters of the Cauchy Distribution to the Mutation Operation  

Lee, Chang-Yong (공주대학교 산업시스템공학과)
Abstract
The mutation operation is the main operation in the evolutionary programming which has been widely used for the optimization of real valued function. In general, the mutation operation utilizes both a probability distribution and its parameter to change values of variables, and the parameter itself is subject to its own mutation operation which requires other parameters. However, since the optimal values of the parameters entirely depend on a given problem, it is rather hard to find an optimal combination of values of parameters when there are many parameters in a problem. To solve this shortcoming at least partly, if not entirely, in this paper, we propose a new mutation operation in which the parameter for the variable mutation is theoretically estimated from the self-adaptive perspective. Since the proposed algorithm estimates the scale parameter of the Cauchy probability distribution for the mutation operation, it has an advantage in that it does not require another mutation operation for the scale parameter. The proposed algorithm was tested against the benchmarking problems. It turned out that, although the relative superiority of the proposed algorithm from the optimal value perspective depended on benchmarking problems, the proposed algorithm outperformed for all benchmarking problems from the perspective of the computational time.
Keywords
evolutionary computation; evolutionary programming; Cauchy probability distribution; mutation operation; optimization problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Fogel, Evolving Artificial Intelligence, Ph. D thesis, University of California, San Diego, CA, 1992.
2 N. Saravanan and D. Fogel, "Learning of Strategy Parameters in Evolutionary Programming: An Empirical Study," In Proc. of the third Ann. Conf. on Evolutionary Programming, edited by A. Sebald and L. Fogel, River Edge, NJ, World Scientific, pp. 269-280, 1994.
3 H.-P. Schwefel, Numerical Optimization of Computer Models, Chichester, UK, John Wiley, 1981.
4 X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol.3, pp.82-102, 1999.   DOI   ScienceOn
5 C.-Y. Lee and X. Yao, "Evolutionary programming using mutations based on the Levy probability distribution," IEEE Trans. Evol. Comput., vol.8, pp.1-13, 2004.   DOI   ScienceOn
6 X. Yao and Y. Lin, "Fast evolution strategies," Contr. Cybern., vol.26, pp.467-496, 1997.
7 M. Ji and J. Klinowski, "Taboo evolutionary programming: a new method of global optimization," Proc. R. Soc. A, vol.462, pp.3613-3627, 2006.   DOI   ScienceOn
8 D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, New York, IEEE Press, 1995.
9 J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.
10 J. Lozano, et al. (Eds.), Towards a new evolutionary computation. Advances in estimation of distribution algorithms, Springer, 2006.
11 L. Fogel, A. Owens, and M. Walsh, Artificial Intelligence Through Simulated Evolution, New York, Wiley, 1966.
12 D. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press, New York, 1995.
13 D. Fogel and J. Atmar, "Comparing Genetic Operators with Gaussian Mutation in Simulated Evolutionary Processes Using Linear Systems," Biological Cybernetics, vol.63, pp.111-114, 1990.   DOI
14 D. Fogel and L. Stayton, "On the Effectiveness of Crossover in Simulated Evolutionary Optimization," BioSystems, vol.32, pp.171-182, 1994.   DOI   ScienceOn
15 P. Somasundaram and K. Kuppusamy, "Application of evolutionary programming to security constrained economic dispatch," International Journal of Electrical Power & Energy Systems, vol.27, pp.343- 351, 2005.   DOI   ScienceOn
16 D. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning, Reading, MA, Addison-Wesley, 1989.
17 T. Back, Evolutionary Algorithms in Theory and Practice, Oxford Univ. Press, New York, 1996.
18 D. Wolpert and W. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol.1, pp.67-82, 1997.   DOI   ScienceOn
19 김우철 등, 통계학 개론, 영지문화사, 2000.
20 N. Sinha, R. Chakrabarti, and P. Chattopadhyay, "Evolutionary programming techniques for economic load dispatch," IEEE Trans. Evol. Comput., vol.7, pp.83-94, 2003.   DOI   ScienceOn
21 R, Hogg and A. Craig, Introduction to mathematical statistics, 4th Ed., Macmillan Publishing Co., Inc. New York, 1978.
22 A. Minhat, I. Musirin, and M. Othman, "Evolutionary programming based technique for secure operating point identification in static voltage stability assessment," J. of Artificial Intelligence, vol.1, pp.12-20, 2008.   DOI
23 S. Kumarl, R. Kumar, K. Thanushkodi, and P. Renuga., "Reactive Power Planning considering the highest load buses using Evolutionary Programming," International Journal of Recent Trends in Engineering, vol.2, pp.37-39, 2009.
24 G. Cui, M. Wong, and H.-K. Lui, "Machine Learning for Direct Marketing Response Models: Bayesian Networks with Evolutionary Programming," Management Science, vol.52, pp.597-612, 2006.   DOI   ScienceOn
25 T. Back and H.-P. Schwefel, "An overview of evolutionary algorithms for parameter optimization," Evol. Comput., vol.1, pp.1-23, 1993.   DOI
26 A. Sebald and J. Schlenzig, "Minimax Design of Neural Net Controllers for Highly Uncertain Plants," IEEE Trans. Neural Networks, vol.5, pp.73-82, 1994.   DOI   ScienceOn
27 D. Fogel, L. Fogel, W. Atmar, and G. Fogel, "Meta-evolutionary programming," in R. Chen editor, Proc. 25th Asilomar Conference on Signals, Systems and Computers, pp.540-545, 1991.