Advertisement

Diversity-Driven Self-adaptation in Evolutionary Algorithms

  • Fanchao ZengEmail author
  • James Decraene
  • Malcolm Yoke Hean Low
  • Suiping Zhou
  • Wentong Cai
Chapter
  • 698 Downloads
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 70)

Abstract

Pareto-based multi-objective optimization problems (MOPs) are currently best solved using evolutionary algorithms. Nevertheless, the performance of these nature-inspired stochastic search algorithms still depends on the suitability of their parameter settings with respect to specific optimization problems. The tuning of the parameters is a crucial task which concerns resolving the contrary goals of convergence and diversity. To address this issue, we propose a diversity-driven self-adaptive mechanism (SAM) for the simulated binary crossover. This novel technique exploits and optimizes the balance between exploration and exploitation during the evolutionary process. This “explore first and exploit later” approach is addressed through the automated and dynamic adjustment of the distribution index of the simulated binary crossover (SBX) operator. We conducted a series of experiments where SAM is applied to the Non-dominated Sorting Genetic Algorithm to solve the Sphere, Rastrigin, and ZDT optimization problems. Our experimental results have shown that our proposed self adaptation mechanism can produce promising results for both single and multi-objective problem sets.

Keywords

Self-adaptive Parameter tuning Simulated binary crossover Evolutionary algorithm 

References

  1. 1.
    Abbass, H.A.: The self-adaptive Pareto differential evolution algorithm. In: Congress on Evolutionary Computation (CEC’2002), vol. 1, pp. 831–836 (2002) Google Scholar
  2. 2.
    Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995) MathSciNetGoogle Scholar
  3. 3.
    Deb, K., Jain, S.: Running performance metrics for evolutionary multi-objective optimization. KanGAL Report, 2002004 (2002) Google Scholar
  4. 4.
    Deb, K., Anand, A., Joshi, D.: A computationally efficient evolutionary algorithm for real-parameter optimization. Evol. Comput. 10(4), 371–395 (2002) CrossRefGoogle Scholar
  5. 5.
    Deb, K., Sindhya, K., Okabe, T.: Self-adaptive simulated binary crossover for real-parameter optimization. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, p. 1194. ACM, New York (2007) Google Scholar
  6. 6.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002) CrossRefGoogle Scholar
  7. 7.
    Janikow, C.Z., Michalewicz, Z.: An experimental comparison of binary and floating point representations in genetic algorithms. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 31–36. Morgan Kaufmann Publishers, San Mateo (1991) Google Scholar
  8. 8.
    Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms. TIK Report, 108 (2001) Google Scholar
  9. 9.
    Meyer-Nieberg, S., Beyer, H.G.: Self-adaptation in evolutionary algorithms. In: Parameter Setting in Evolutionary Algorithms, pp. 47–75 (2007) Google Scholar
  10. 10.
    Tan, K.C., Chiam, S.C., Mamun, A.A., Goh, C.K.: Balancing exploration and exploitation with adaptive variation for evolutionary multi-objective optimization. Eur. J. Oper. Res. 197(2), 701–713 (2009) zbMATHCrossRefGoogle Scholar
  11. 11.
    Tan, K.C., Goh, C.K., Yang, Y.J., Lee, T.H.: Evolving better population distribution and exploration in evolutionary multi-objective optimization. Eur. J. Oper. Res. 171(2), 463–495 (2006) zbMATHCrossRefGoogle Scholar
  12. 12.
    Zeng, F., Low, M.Y.H., Decraene, J., Zhou, S., Cai, W.: Self-adaptive mechanism for multi-objective evolutionary algorithms. In: Lecture Notes in Engineering and Computer Science: Proceedings of The International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010, Hong Kong, 17–19 March 2010, pp. 7–12 (2010) Google Scholar
  13. 13.
    Zitzler, E., Laumanns, M., Thiele, L., et al.: SPEA2: improving the strength Pareto evolutionary algorithm. In: EUROGEN, pp. 95–100 (2001) Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Fanchao Zeng
    • 1
    Email author
  • James Decraene
    • 2
  • Malcolm Yoke Hean Low
    • 3
  • Suiping Zhou
    • 4
  • Wentong Cai
    • 5
  1. 1.Parallel and Distributed Computing Centre, School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore
  2. 2.Parallel and Distributed Computing Centre, School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore
  3. 3.Parallel and Distributed Computing Centre, School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore
  4. 4.Parallel and Distributed Computing Centre, School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore
  5. 5.Parallel and Distributed Computing Centre, School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore

Personalised recommendations