J4 ›› 2014, Vol. 41 ›› Issue (6): 100-105.doi: 10.3969/j.issn.1001-2400.2014.06.017

• Original Articles • Previous Articles     Next Articles

Central force optimization algorithm via clustering simplex search

LIU Jie1,2;WANG Yuping3   

  1. (1. School of Mathematics and Statistics, Xidian Univ., Xi'an  710071, China;
    2. College of Science, Xi'an University of Science and Technology, Xi'an  710054, China;
    3. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China)
  • Received:2014-02-28 Online:2014-12-20 Published:2015-01-19
  • Contact: LIU Jie E-mail:tears191@foxmail.com

Abstract:

An improved central force optimization (CFO) is proposed based on the clustering and simplex method for global optimization. The clustering simplex (CS) operator is introduced to a new algorithm in the evolution process. Vertices of simplex are selected by clustering methods, and a periodical migrating of the best individual is introduced by the CS operator. CS can get away from local converged points by virtue of CFO, and CFO can improve its local exploiting capability and effectively speed up the convergence under the help of CS. Experimental results show that the proposed hybrid CSCFO algorithm is better than other algorithms in convergent speed and searching precision.

Key words: central force optimization, cluster analysis, simplex, global optimization

CLC Number: 

  • TP301