International Journal of Fuzzy Logic and Intelligent Systems

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Derivative Evaluation and Conditional Random Selection for Accelerating Genetic Algorithms

  • Jung, Sung-Hoon (Department of Information and Communication Engineering, Hansung Univ.)
  • Published : 2005.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

Keywords

References

  1. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison--Wesley, 1989
  2. C. L. Karr and E. J. Gentry, 'Fuzzy Control of pH Using Genetic Algorithms,' IEEE Trans. on Fuzzy Systems, vol. 1, pp. 46--53, Jan. 1993 https://doi.org/10.1109/TFUZZ.1993.390283
  3. M. Srinivas and L. M. Patnaik, 'Genetic Algorithms: A Survey,' IEEE Computer Magazine, pp. 17-26, June 1994
  4. J. L. R. Filho and P. C. Treleaven, ' Genetic-Algorithm Programming Environments,' IEEE Computer Magazine, pp. 28--43, June 1994
  5. D. Beasley, D. R. Bull, and R. R. Martin, 'An Overview of Genetic Algorithms: Part 1, Fundamentals ,' Technical Report
  6. D. B. Fogel, 'An Introduction to Simulated Evolutionary Optimization,' IEEE Trans. on Neural Networks, vol. 5, pp. 3-14, Jan. 1994 https://doi.org/10.1109/72.265956
  7. H. Szczerbicka and M. Becker, 'Genetic Algorithms: A Tool for Modelling, Simulation, and Optimization of Complex Systems, H. Szczerbicka and M. Becker, 'Genetic Algorithms: A Tool for Modelling, Simulation, and Optimization of Complex Systems, Cybernetics and Systems: An International Journal, vol. 29, pp. 639-659, Aug. 1998
  8. RYang and I. Douglas, 'Simple Genetic Algorithm with Local Tuning: Efficient Global Optimizing Technique,' Journal of Optimization Theory and Applications, vol. 98, pp. 449--465, Aug. 1998 https://doi.org/10.1023/A:1022697719738
  9. C. Xudong, Q. Jingen, N. Guangzheng, Y. Shiyou, and Z. Mingliu, ' An Improved Genetic Algorithm for Global Optimization of Electromagnetic Problems,' IEEE Trans. on Magnetics , vol. 37, pp. 3579-3583, Sept. 2001 https://doi.org/10.1109/20.952666
  10. L. Davis, 'Adapting Operator Probabilities in Genetic Algorithms ,' in Proceedings of the 3rd International Conference on Genetic Algorithms and their Applications, pp. 61-69, 1989
  11. R. Hinterding, 'Gaussian Mutation and Self-adaption in Numeric Genetic Algorithms,' in Proceedings of the 2nd IEEE International Conference on Evolutionary Computation, pp. 384--389, 1995 https://doi.org/10.1109/ICEC.1995.489178
  12. R. Hinterding, Z. Michalewicz, and A. E. Eiben, 'Adaptation in Evolutionary Computation: A Survey,' in Proceedings of the 4th IEEE International Conference on Evolutionary Computation, pp. 65-69, 1997 https://doi.org/10.1109/ICEC.1997.592270
  13. J. E. Smith and T. C. Fogarty, 'Operator and parameter adaptation in genetic algorithms,' Soft computing : a fusion of foundations, methodologies and applications, vol. 92, no. 2, pp. 81-87, 1997
  14. M. C. Sinclair, 'Operator-probability Adaptation in a Genetic-algorithm/Heuristic Hybrid for Optical Network Wavelength Allocation,' in Proc. IEEE Inti. Conf. on Evolutionary Computation (ICEC'98), Anchorage, Alaska, USA , pp. 840-845, 1998 https://doi.org/10.1109/ICEC.1998.700161
  15. A. Tuson and P. Ross, 'Adapting Operator Settings In Genetic Algorithms,' Evolutionary Computation, vol. 6, no. 2, pp. 161-184, 1998 https://doi.org/10.1162/evco.1998.6.2.161
  16. C. W. Ho, K. H. Lee, and K. S. Leung, 'A Genetic Algorithm Based on Mutation and Crossover with Adaptive Probabilities,' in Proceedings of the 1999 Congress on Evolutionary Computation, vol. 1, pp. 768-775, 1999
  17. J. Andre, P. Siarry, and T. Dognon, 'An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization,' Advances in engineering software, vol. 32, no. 1, pp. 49-60, 2001 https://doi.org/10.1016/S0965-9978(00)00070-3
  18. S. H. Jung, 'Queen-bee evolution for genetic algorithms,' Electronics Letters, vol. 39, pp. 575--576, Mar. 2003 https://doi.org/10.1049/el:20030383