期刊文献+

双边拆卸线平衡问题建模与优化 被引量:11

Modeling and Optimization for Two-sided Disassembly Line Balancing Problems
下载PDF
导出
摘要 针对实际作业中部分产品采用双边拆卸,但已有拆卸线平衡问题研究中工作站均为单边布局的不足,建立了多目标双边拆卸线平衡问题模型。解码时,将任务优先分配至工作站较少的边、次优先分配至剩余时间较多的工作站,以缩短输送路径和工作站空闲时间。针对所建立模型,提出一种Pareto蝙蝠算法,引入Pareto思想以保证解的多样性;采用精英策略有效加速算法的收敛;通过拥挤距离筛选外部档案以提高算法运行效率。通过求解经典算例并对比分析,验证了所提出算法的有效性。将所建模型应用于拆卸线设计,能为决策者提供多种高质量的平衡方案。 In view of the shortages that the previous disassembly line balancing problems all set the workstation in the same way but some products adopted two-sided disassembly in actual productions, a model of multi-objective two-sided disassembly line balancing problems was built. To reduce the transport path and idle time of workstations, the tasks were assigned to the sides whose workstation numbers were low prior, then considering the workstations whose remaining time was ample. A Pareto bat algorithm was put forward to solve the two-sided disassembly line balancing problems, Pareto was introduced to save the diversity of the solutions, the adoption of elitism strategy speeded up the convergence rate of the algorithm effectively, the operating efficiency of the proposed algorithm was improved by the adoption of crowded distance to external files. The effectiveness of the proposed algorithm was verified by testing the classic problems and comparing with other algorithms. The two-sided model was applied to design the disassembly lines, and the results may provide various balancing programs with high quality.
作者 邹宾森 张则强 李六柯 蔡宁 ZOU Binsen;ZHANG Zeqiang;LI Liuke;CAI Ning(School of Mechanical Engineering, Southwest Jiaotong University, Chengdu, 610031)
出处 《中国机械工程》 EI CAS CSCD 北大核心 2018年第9期1090-1097,1107,共9页 China Mechanical Engineering
基金 国家自然科学基金资助项目(51205328 51405403) 教育部人文社会科学研究青年基金资助项目(12YJCZH296) 四川省应用基础研究计划资助项目(2014JY0232)
关键词 双边布局 拆卸线平衡问题 蝙蝠算法 PARETO two-sided layout disassembly line balancing problem bat algorithm Pareto
  • 相关文献

参考文献4

二级参考文献35

  • 1王俊伟,汪定伟.粒子群算法中惯性权重的实验与分析[J].系统工程学报,2005,20(2):194-198. 被引量:85
  • 2崔建双,李铁克,张文新.混合流水车间调度模型及其遗传算法[J].北京科技大学学报,2005,27(5):623-626. 被引量:29
  • 3孟伟,韩学东,洪炳镕.蜜蜂进化型遗传算法[J].电子学报,2006,34(7):1294-1300. 被引量:78
  • 4GUPTA S M, GUNGOR A. Product recovery using a disassembly line: challenges and solution[C]//Proceedings of the 2001 IEEE International Symposium on Electronics and the Environment. Colorado: , 2001: 36-40.
  • 5DUTA L, FILIP F G, CACIULA I. Real time balancing of complex disassembly lines[C]//17th World Congress, International Federation of Automatic Control, IFAC. Seoul: , 2008: 913-918.
  • 6MCGOVERN S M, GUPTA S M. A balancing method and genetic algorithm for disassembly line balancing[J].European Journal of Operational Research, 2007, 179(3): 692-708.
  • 7LAMBERT A, GUPTA S M. Methods for optimum and near optimum disassembly sequencing[J].International Journal of Production Research, 2008, 46(11): 2845-2865.
  • 8MCGOVERN S, GUPTA S. Ant colony optimization for disassembly sequencing with multiple objectives[J].The International Journal of Advanced Manufacturing Technology, 2006, 30(5/6): 481-496.
  • 9HEZER S, KARA Y. A network-based shortest route model for parallel disassembly line balancing problem[J].International Journal of Production Research, 2015, 53(6): 1849-1865.
  • 10KALAYCI C B, POLAT O, GUPTA S M. A variable neighbourhood search algorithm for disassembly lines[J].Journal of Manufacturing Technology Management, 2015, 26(2): 182-194.

共引文献220

同被引文献58

引证文献11

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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