Volume 5 Number 6 (Jun. 2010)
Home > Archive > 2010 > Volume 5 Number 6 (Jun. 2010) >
JCP 2010 Vol.5(6): 965-972 ISSN: 1796-203X
doi: 10.4304/jcp.5.6.965-972

A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems

Yongquan Zhou and Shengyu Pei
College of Mathematics and Computer Science Guangxi University for Nationalities, Nanning 530006, China

Abstract—This paper presents an effective hybrid coevolutionary particle swarm optimization algorithm for solving constrained engineering design problems, which is based on simulated annealing (SA) , employing the notion of co-evolution to adapt penalty factors. By employing the SAbased selection for the best position of particles and swarms when updating the velocity in co-evolutionary particle swarm optimization algorithm. Simulation results based on well-known constrained engineering design problems demonstrate the effectiveness, efficiency and robustness on initial populations of the proposed, and can reach a high precision.

Index Terms—Particle swarm optimization; Simulated annealing; Constrained optimization; Co-evolution; Penalty function

[PDF]

Cite: Yongquan Zhou and Shengyu Pei, " A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems," Journal of Computers vol. 5, no. 6, pp. 965-972, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>