Optimizing scheduling finishing of hot strip mills by IPSO

被引:0
作者
Wang Jian-hui [1 ]
Xu Lin [1 ]
Yan Yong-liang [1 ]
Fang Xiao-ke [1 ]
Gu Shu-sheng [1 ]
机构
[1] Northeastern Univ, Fac Informat Sci & Engn, Shenyang 110004, Peoples R China
来源
PROCEEDINGS OF 2005 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1 AND 2 | 2005年
关键词
improving PSO algorithm; hot strip; strip mills; scheduling;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The PSO has been used wildly. But the shorts of lowconvergence precision and premature convergence are still existent. So a method of variational Inertia Weight is applied to improve the convergence precision, and a mutation method of particle best is presented to avoid the premature convergence. Thus the IPSO is presented and applied in scheduling the finishing of hot strip mills. The simulation results show that IPSO is a successful and feasible approach for the scheduling optimization, and the global convergency and convergence precision are better.
引用
收藏
页码:810 / 813
页数:4
相关论文
共 5 条
[1]  
Eberhart R, 1995, MHS 95 P 6 INT S MIC, P39, DOI DOI 10.1109/MHS.1995.494215
[2]  
Eberhart RC, 2000, IEEE C EVOL COMPUTAT, P84, DOI 10.1109/CEC.2000.870279
[3]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[4]  
[王焱 Wang Yan], 2002, [北京科技大学学报, Journal of University Science and Technology Beijing], V24, P339
[5]  
Xie Xiao-feng, 2003, Control and Decision, V18, P129