• DocumentCode
    3346178
  • Title

    Chaotic GEP algorithm for dynamic multi-objective optimization

  • Author

    Weihong Wang ; Yanye Du ; Qu Li ; Zhaolin Fang

  • Author_Institution
    Dept. of Comput. Sci., Zhejiang Univ. of Technol., Hangzhou, China
  • Volume
    2
  • fYear
    2011
  • fDate
    26-28 July 2011
  • Firstpage
    1067
  • Lastpage
    1071
  • Abstract
    Dynamic Multi-objective Optimization (DMO) is a new research topic in the field of evolutionary computation in recent years. As Gene Expression Programming (GEP) has a powerful search capability, a new algorithm for DMO called D-GEP Chaotic NSGA-II is proposed. The algorithm is designed on the classic multi-objective optimization algorithm NSGA-II to make it suitable for DMO, while using GEP for encoding and chaotic variables for generating initial population. The experiments on test problems of three different types have shown that the algorithm has better performance on convergence, diversity and the breadth of the distribution.
  • Keywords
    chaos; dynamic programming; evolutionary computation; search problems; D-GEP Chaotic NSGA-II; chaotic GEP algorithm; classic multi objective optimization algorithm NSGA-II; dynamic multi objective optimization; evolutionary computation; gene expression programming; powerful search capability; Algorithm design and analysis; Chaos; Convergence; Gene expression; Heuristic algorithms; Optimization; Programming; Chaotic Optimization; Dynamic Multi-objective Optimization (DMO); Gene Expression Programming (GEP);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2011 Seventh International Conference on
  • Conference_Location
    Shanghai
  • ISSN
    2157-9555
  • Print_ISBN
    978-1-4244-9950-2
  • Type

    conf

  • DOI
    10.1109/ICNC.2011.6022293
  • Filename
    6022293