Multi Objective Particle Swarm Optimization Based on Dynamic Adjustment
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference
  • |
  • Related [20]
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    To improve the diversity and convergence of Pareto front generated by multi objective particle swarm optimization, a detection mechanism for evolutionary state of multi objective particle swarm optimization is presented in this paper. The evolutionary state of the algorithm is assumed by detecting the updating situation of the external Pareto set to get the feedback information to adjust the evolutionary strategy of the algorithm dynamically. It enables the algorithm to take the diversity and convergence of the approximate Pareto front into account in the process of the evolution. Finally, the proposed algorithm shows a good performance compared with other four kinds of equivalence algorithms in the ZDT series test function.

    Reference
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李克文,张永哲.基于动态调整的多目标粒子群优化算法.计算机系统应用,2017,26(7):161-166

Copy
Share
Article Metrics
  • Abstract:1886
  • PDF: 2905
  • HTML: 0
  • Cited by: 0
History
  • Received:October 20,2016
  • Revised:November 14,2016
  • Online: October 31,2017
Article QR Code
You are the first990794Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063