期刊文献+

混流装配线排序的改进离散微粒群优化算法 被引量:2

Modified discrete Particle Swarm Optimization algorithm for Mixed model assembly line sequencing
下载PDF
导出
摘要 提出在离散空间用一种改进的微粒群优化算法来解决混流装配线的多目标排序问题,考虑两个目标:总生产变化率最小和总闲置-超载时间最小,并对两个目标函数进行了规范化处理以消除量纲的影响。在基本的微粒群算法基础上,提出了适应离散编码的粒子位置编码方式,引入了动态参数方法来提高算法的搜索性能和收敛能力。对实际混流装配线的仿真实验表明提出的改进微粒群优化算法可以直接应用于离散问题并保持了基本微粒群算法的优良性能,是一种性能较好的高效的混流装配线排序算法。 This paper proposed a modified Particle Swarm Optimization (PSO) algorithm to solve the mixed model assembly line sequencing problem in discrete space with two objectives:total production rate variation and total idle-overload time.Compared with the original PSO,this paper presented the encoding method suited for discrete code,and introduced a dynamic parameter scheme to enhance the search ability and the convergence ability.In order to eliminate the effect of dimension,the two objective functions were regulated.The experiments on a mixed model assembly line show that the modified discrete PSO algorithm maintains the advantages of PSO algorithm and can solve the mixed model assembly line sequencing problem effectively and rapidly.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第12期218-221,共4页 Computer Engineering and Applications
基金 上海市重点学科建设项目No.y0102 上海大学研究生创新基金(No.shucx080140)~~
关键词 改进离散微粒群优化算法 混流装配线 排序 多目标 modified discrete Particle Swarm Optimization algorithm(PSO) mixed model assembly line sequencing multi--objective
  • 相关文献

参考文献12

  • 1Kennedy J,Eberhart R C.Partiele swarm optimization[C]//Proceedings of IEEE International Confference on Neural Networks.Perth, Australia : IEEE Piseataway, 1995 : 1942-1948.
  • 2Tasgetiren M F,Sevkli M,Liang Y C,et al.Particle swarm optimization algorithm for single machine total weighted tardiness problem[C]//Proceedings of the 2004 Congress on Evolutionary Computation( CEC2004 ), Portland, Oregon, USA, 2004:1412-1419.
  • 3Clerc M.Discrete particle swarm optimization for traveling salesman problem.http ://clerc.maurice.free.fr/pso/.
  • 4Tasgetiren M F,Liang Y C,Sevkli M,et al.Particle swarm optimization algorithm for makcspan and total flowtime minimization in the permutation flowshop sequencing problem[J].European Journal of Operatiowal Research, 2007, 177 (3) : 1930-1947.
  • 5Liao Ching-Jong,Tseng Chao-Tang,Pin Luarn.A discrete version of particle swarm optimization for flowshop scheduling problems[J]. Computers & Opezations Research, 2007,34( 10) : 3099-3111.
  • 6Pan Quan-ke,Fatih M,Tasgetircn,et al.A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem[JJ.Computers & Operations Research,2007,34( 1 ) : 1-33.
  • 7Salman A,Ahmad I,AI-Madani S.Particle swarm optimization for task assignment ptoblem[J].Microprocessors and Microsystems,2002, 26:363-371.
  • 8Chandrasekaran S,Ponnambalam S G,Suresh R K,et al.A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems[C]//2006 IEEE Conference on Cybernetics and Intelligent Systems , 2006 :1-6.
  • 9Rahimi-Vahed A R,Rabbani M,Tavakkoli-Moghaddam R,et al.A multi-objective scatter seareh for a mixed-model assembly line sequencing problem[J].Advanced Engineering Informatics,2007,21 ( 1 ) : 85-99.
  • 10宋华明,韩玉启,杨慧.多品种混合型装配流水线的平衡设计[J].中国机械工程,2003,14(6):475-478. 被引量:26

二级参考文献2

共引文献25

同被引文献28

  • 1曹振新,朱云龙,赵明扬,尹朝万,李富明.混流装配线负荷平衡与投产排序的优化研究[J].信息与控制,2004,33(6):660-664. 被引量:24
  • 2吴尔飞,金烨,续爱民,胡小锋.基于改进遗传算法的双边装配线平衡[J].计算机集成制造系统,2007,13(2):268-274. 被引量:19
  • 3Andreas Drexl,Alf Kimms.Sequencing JIT Mixed-Model Assembly Lines under Station-Load and Part-Usage Constraints[J].Management Science,2001(3):480-491.
  • 4赵建辉,王红军.基于Flexsim的混流装配线投产顺序的仿真[J].微计算机信息,2007(24):29-31. 被引量:20
  • 5张则强,程文明,钟斌,王金诺.求解装配线平衡问题的一种改进蚁群算法[J].计算机集成制造系统,2007,13(8):1632-1638. 被引量:37
  • 6SCHOLL A, BECKER C. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing[-J]. Eu- ropean Journal of Operational Research, 2006, 168 (3): 666-693.
  • 7WEE T S, MAGAZINE M J. Assembly line balancing as gen-eralized bin packingJ. Operations Research Letters, 1982, 1 (2) : 56-58.
  • 8TASAN S, TUNALI S. A review of the current applications of genetic algorithms in assembly line balaneingEJ. Journal of Intelligent Manufacturing, 2008,19 ( 1 ) : 49-69.
  • 9KENNEDY J, EBERHART R. [C//Proeeedings of the 1EEE Neural Networks. Piscataway, 1995:1942-1948. Particle swarm optimization International Conference on N. J. , USA: IEEE Press,.
  • 10TASGETIREN M F, LIANG Y C, SEVKLI M, et al. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequen- cing problem[-J. European Journal of Operational Research, 2007,177(3) : 1930-1947.

引证文献2

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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