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

코시 분포의 축척 매개변수를 추정하여 돌연변이 연산에 적용한 진화 프로그래밍

  • 이창용 (공주대학교 산업시스템공학과)
  • Received : 2010.04.26
  • Accepted : 2010.07.19
  • Published : 2010.09.15


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.

진화 프로그래밍은 실수형 최적화 문제에 널리 사용되는 알고리즘으로 돌연변이 연산이 중요한 연산이다. 일반적으로 돌연변이 연산은 확률 분포와 이에 따른 매개변수를 사용하여 변수값을 변화시키는데, 이 때 매개변수 역시 돌연변이 연산의 대상이 됨으로 이를 위한 또 다른 매개변수가 필요하다. 그러나 최적의 매개변수 값은 주어진 문제에 전적으로 의존하기 때문에 매개변수 개수가 많은 경우 매개변수값들에 대한 최적 조합을 찾기 어렵다. 이러한 문제를 부분적으로나마 해결하기 위하여 본 논문에서는 변수의 돌연변이 연산을 위한 매개변수를 자기 적응적 관점에서 이론적으로 추정한 돌연변이 연산을 제안하였다. 제안한 알고리즘에서는 코시 확률 분포의 축척 매개변수를 추정하여 돌연변이 연산에 적용함으로 축척 매개변수에 대한 돌연변이 연산이 필요하지 않다는 장점이 있다. 제안한 알고리즘을 벤치마킹 문제에 적용한 실험 결과를 통해 볼 때, 최적값 측면에서는 제안한 알고리즘의 상대적 우수성은 벤치마킹 문제에 의존하였으나 계산 시간 측면에서는 모든 벤치마킹 문제에 대하여 제안한 알고리즘이 우수하였다.


  1. D. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning, Reading, MA, Addison-Wesley, 1989.
  2. T. Back, Evolutionary Algorithms in Theory and Practice, Oxford Univ. Press, New York, 1996.
  3. D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, New York, IEEE Press, 1995.
  4. J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.
  5. J. Lozano, et al. (Eds.), Towards a new evolutionary computation. Advances in estimation of distribution algorithms, Springer, 2006.
  6. L. Fogel, A. Owens, and M. Walsh, Artificial Intelligence Through Simulated Evolution, New York, Wiley, 1966.
  7. D. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press, New York, 1995.
  8. 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. https://doi.org/10.1007/BF00203032
  9. D. Fogel and L. Stayton, "On the Effectiveness of Crossover in Simulated Evolutionary Optimization," BioSystems, vol.32, pp.171-182, 1994. https://doi.org/10.1016/0303-2647(94)90040-X
  10. 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. https://doi.org/10.1109/72.265962
  11. 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.
  12. D. Fogel, Evolving Artificial Intelligence, Ph. D thesis, University of California, San Diego, CA, 1992.
  13. 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.
  14. H.-P. Schwefel, Numerical Optimization of Computer Models, Chichester, UK, John Wiley, 1981.
  15. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol.3, pp.82-102, 1999. https://doi.org/10.1109/4235.771163
  16. 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. https://doi.org/10.1109/TEVC.2003.816583
  17. X. Yao and Y. Lin, "Fast evolution strategies," Contr. Cybern., vol.26, pp.467-496, 1997.
  18. M. Ji and J. Klinowski, "Taboo evolutionary programming: a new method of global optimization," Proc. R. Soc. A, vol.462, pp.3613-3627, 2006. https://doi.org/10.1098/rspa.2006.1740
  19. N. Sinha, R. Chakrabarti, and P. Chattopadhyay, "Evolutionary programming techniques for economic load dispatch," IEEE Trans. Evol. Comput., vol.7, pp.83-94, 2003. https://doi.org/10.1109/TEVC.2002.806788
  20. 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. https://doi.org/10.1016/j.ijepes.2004.12.006
  21. 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. https://doi.org/10.3923/jai.2008.12.20
  22. 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.
  23. 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. https://doi.org/10.1287/mnsc.1060.0514
  24. R, Hogg and A. Craig, Introduction to mathematical statistics, 4th Ed., Macmillan Publishing Co., Inc. New York, 1978.
  25. T. Back and H.-P. Schwefel, "An overview of evolutionary algorithms for parameter optimization," Evol. Comput., vol.1, pp.1-23, 1993. https://doi.org/10.1162/evco.1993.1.1.1
  26. D. Wolpert and W. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol.1, pp.67-82, 1997. https://doi.org/10.1109/4235.585893
  27. 김우철 등, 통계학 개론, 영지문화사, 2000.