A robust evolutionary algorithm for global optimization

Jinn-Moon Yang*, Chin Jen Lin, Cheng Yan Kao

*Corresponding author for this work

Research output: Contribution to journalArticle

3 Scopus citations


This paper studies an evolutionary algorithm for global optimization. Based on family competition and adaptive rules, the proposed approach consists of global and local strategies by integrating decreasing-based mutations and self-adaptive mutations. The proposed approach is experimentally analyzed by showing that its components can integrate with one another and possess good local and global properties. Following the description of implementation details, the approach is then applied to several widely used test sets, including problems from international contests on evolutionary optimization. Numerical results indicate that the new approach performs very robustly and is competitive with other well-known evolutionary algorithms.

Original languageEnglish
Pages (from-to)405-425
Number of pages21
JournalEngineering Optimization
Issue number5
StatePublished - 1 Jan 2002


  • Adaptive rules
  • Evolutionary algorithms
  • Family competition
  • Global optimization
  • Multiple mutation operators

Fingerprint Dive into the research topics of 'A robust evolutionary algorithm for global optimization'. Together they form a unique fingerprint.

  • Cite this