Volume 5 Number 8 (Aug. 2010)
Home > Archive > 2010 > Volume 5 Number 8 (Aug. 2010) >
JCP 2010 Vol.5(8): 1144-1151 ISSN: 1796-203X
doi: 10.4304/jcp.5.8.1144-1151

An Effective Adaptive Multi-objective Particle Swarm for Multimodal Consreained Function Optimization

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

Abstract—This paper presents a novel adaptive multiobjective particle swarm optimization algorithm and with adaptive multi-objective particle swarm algorithm for solving objective constrained optimization problems, in which Pareto non-dominated ranking, tournament selection, crowding distance method were introduced, simultaneously the rate of crowding distance changing were integrated into the algorithm. Finally, ten standard functions are used to test the performance of the algorithm, experimental results show that the proposed approach is an efficient and achieve a high-quality performance.

Index Terms—Particle Swarm Optimization Algorithm; Adaptability Multi-objective Optimization; Constrained optimization; Test functions

[PDF]

Cite: Yongquan Zhou and Shengyu Pei, " An Effective Adaptive Multi-objective Particle Swarm for Multimodal Consreained Function Optimization," Journal of Computers vol. 5, no. 8, pp. 1144-1151, 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>>