期刊文献+

Novel Discrete Particle Swarm Optimization Based on Huge Value Penalty for Solving Engineering Problem 被引量:7

Novel Discrete Particle Swarm Optimization Based on Huge Value Penalty for Solving Engineering Problem
在线阅读 下载PDF
导出
摘要 For the purpose of solving the engineering constrained discrete optimization problem, a novel discrete particle swarm optimization(DPSO) is proposed. The proposed novel DPSO is based on the idea of normal particle swarm optimization(PSO), but deals with the variables as discrete type, the discrete optimum solution is found through updating the location of discrete variable. To avoid long calculation time and improve the efficiency of algorithm, scheme of constraint level and huge value penalty are proposed to deal with the constraints, the stratagem of reproducing the new particles and best keeping model of particle are employed to increase the diversity of particles. The validity of the proposed DPSO is examined by benchmark numerical examples, the results show that the novel DPSO has great advantages over current algorithm. The optimum designs of the 100-1 500 mm bellows under 0.25 MPa are fulfilled by DPSO. Comparing the optimization results with the bellows in-service, optimization results by discrete penalty particle swarm optimization(DPPSO) and theory solution, the comparison result shows that the global discrete optima of bellows are obtained by proposed DPSO, and confirms that the proposed novel DPSO and schemes can be used to solve the engineering constrained discrete problem successfully. For the purpose of solving the engineering constrained discrete optimization problem, a novel discrete particle swarm optimization(DPSO) is proposed. The proposed novel DPSO is based on the idea of normal particle swarm optimization(PSO), but deals with the variables as discrete type, the discrete optimum solution is found through updating the location of discrete variable. To avoid long calculation time and improve the efficiency of algorithm, scheme of constraint level and huge value penalty are proposed to deal with the constraints, the stratagem of reproducing the new particles and best keeping model of particle are employed to increase the diversity of particles. The validity of the proposed DPSO is examined by benchmark numerical examples, the results show that the novel DPSO has great advantages over current algorithm. The optimum designs of the 100-1 500 mm bellows under 0.25 MPa are fulfilled by DPSO. Comparing the optimization results with the bellows in-service, optimization results by discrete penalty particle swarm optimization(DPPSO) and theory solution, the comparison result shows that the global discrete optima of bellows are obtained by proposed DPSO, and confirms that the proposed novel DPSO and schemes can be used to solve the engineering constrained discrete problem successfully.
出处 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2009年第3期410-418,共9页 中国机械工程学报(英文版)
基金 supported by National Hi-tech Research and Development Program of China (Grant No. 2006aa042439)
关键词 discrete particle swarm optimization location updating scheme of constraints level huge value penalty optimization design BELLOWS discrete particle swarm optimization, location updating, scheme of constraints level, huge value penalty, optimization design, bellows
  • 相关文献

参考文献4

二级参考文献27

共引文献121

同被引文献79

引证文献7

二级引证文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部