期刊文献+

汽车混流装配线的混合布谷鸟算法排序研究 被引量:7

Research of mixed-model automobile assembly sequencing based on hybrid cuckoo search algorithm
下载PDF
导出
摘要 为解决汽车混流装配线作业者工作负荷不均衡的问题,构建了最小化违背装配频率上限次数的优化模型,提出了布谷鸟算法与遗传算法相结合的混合算法。该方法将遗传算法的选择与交叉思想引入布谷鸟算法的迭代过程,以克服布谷鸟算法寻优过程中收敛速度慢和容易陷入局部最优的问题。测试函数的对比求解和合作汽车企业的优化实例表明该改进算法具有更高的求解精度和更快的收敛速度,能有效地解决大规模的汽车混流装配线排序优化问题。 For the solution of the unbalance workload in mixed-model automobile assembly line,an optimization model,in which the limit of violating assemble frequency is minimized,is constructed and a hybrid method based on cuckoo search algorithm and genetic algorithm is proposed.In the proposed method,by integrating the selection and crossover theory of genetic algorithm into the iteration process of cuckoo search,the problem of cuckoo search algorithm,where the convergence rate has been slowed down and local optimal is easily resulted,is avoided.The results of standard test functions and an application example of cooperation automobile verify that the proposed hybrid method has higher accuracy and faster convergence rate.Therefore,the proposed hybrid method can effectively solve the problem of sequencing optimization in large-scale automobile assembly.
作者 余方平 刘坚 马灿 YU Fangping;LIU Jian;MA Can(State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, Changsha 410082, China)
出处 《计算机工程与应用》 CSCD 北大核心 2017年第8期240-245,共6页 Computer Engineering and Applications
基金 国家自然科学基金(No.71271078) 湖南省战略新兴产业重大专项资助项目(No.2013GK4049) 长沙市科技重大专项资助项目(No.K1306007-11-1)
关键词 混流装配线 负荷均衡 排序 布谷鸟算法 mixed-model assembly line load balancing scheduling cuckoo search algorithm
  • 相关文献

参考文献5

二级参考文献47

  • 1李斌,陈立平,黄正东,肖人彬,钟毅芳.面向大规模定制的装配线优化调度研究[J].中国机械工程,2005,16(24):2198-2202. 被引量:14
  • 2Gaafar L K, Masoud S A. Genetic Algorithm and Simulated Annealing for Scheduling in Agile Manufacturing[J]. International Journal of Production Research, 2005,43 (14) : 3069-3085.
  • 3Thiagarajan S,Rajendran C. Scheduling in Dynamic Assembly Job-shops with Jobs Having Different Holding and Tardiness Costs [J]. International Journal of Production Research, 2003, 41 ( 18 ) : 4453-4486.
  • 4Thiagarajan S,Rajendran C. Scheduling in Dynamic Assembly Jobshops to Minimize the Sum of Weighted Earliness, Weighted Tardiness and Weighted Flowtime of Jobs[J]. Computers and Industrial Engineering, 2005,49 (4) : 463-503.
  • 5Lee C Y,Cheng T C E,Lin B M T. Minimizing the Makespan in the 3- Machine Assembly- type Flowshop Scheduling Problem [J]. Management Science, 1993,39 (5) : 616-625.
  • 6Potts C N,Sevast'janov S V,Strusevich V A,et al. The Two stage Assembly Scheduling Problem: Complexity and Approximation[J]. Operations Research,1995,43(2) :346-355.
  • 7Hariri A M A,Potts C N. A Branch and Bound Algorithm for the Two-stage Assembly Scheduling Problem[J]. European Journal of Operational Research, 1997,103(3): 547-556.
  • 8Cheng T C E, Wang G. Scheduling the Fabrication and Assembly of Components in a Two-machine Flow Shop[J] IIE Transactions, 1999,31 (2) : 135- 143.
  • 9Lin B M T,Cheng T C E. Fabrication and Assembly Scheduling in a Two-machine Flowshop[J]. IIE Transactions, 2002,34 (11) : 1015-1020.
  • 10Yokoyama M. Hybrid Flow-shop Scheduling with Assembly Operations [J]. International Journal of Production Economics, 2001,73 ( 2 ):103-116.

共引文献95

同被引文献51

引证文献7

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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