期刊文献+

基于改进社会工程算法的拆解线平衡多目标优化设计 被引量:1

Multi-objective Optimization of Disassembly Line Balancing Based on Improved Social Engineering Optimizer
下载PDF
导出
摘要 目的 为了提高拆卸效率,减少拆卸成本和拆卸能耗,提出一种基于社会工程算法的优化方法。方法 首先根据社会工程算法的原理设计了编码和解码方式,然后引入交换子和交换序列的概念,对算法中的训练和再训练、发现攻击和响应攻击等步骤进行设计,最后选取一个高速电子套结机作为实验对象进行了验证。结果 与其他多目标优化算法相比,具有良好的寻优能力。结论 提出的算法有效地解决了拆解线平衡问题,与其他算法相比具有更好的性能。 This paper aims to improve disassembly efficiency and reduce disassembly cost and disassembly energy consumption, and an optimization method based on a social engineering optimizer is proposed. Firstly, in this paper, the encoding and decoding method is designed according to the principle of social engineering optimizer. And then the concepts of swap sub and swap sequence are introduced. Next, the steps of training and retraining, discovering attack and responding to attack in the algorithm are designed. Finally, a high-speed electronic tacking machine is selected as the experimental objective for validation. This method has good optimization capacity compared with other multi-objective algorithms. The proposed algorithm effectively addresses the disassembly line balancing problem and has better performance compared with other algorithms.
作者 田广东 张志峰 张诚 张乐乐 TIAN Guang-dong;ZHANG Zhi-feng;ZHANG Cheng;ZHANG Le-le(Transport Industry Key Laboratory of Vehicle Detection,Diagnosis and Maintenance Technology,ShanDong JiaoTong University,Jinan 250357,China;State Key Laboratory of Fluid Power&Mechatronic Systems,Zhejiang University,Hangzhou 310027,China;School of Mechanical Engineering,Shandong University,Jinan 250061,China;Transport Management Institute Ministry of Transport of the P.R.China,Ministry of Comprehensive Transport Education and Research,Beijing 101601,China)
出处 《包装工程》 CAS 北大核心 2022年第12期52-58,共7页 Packaging Engineering
基金 浙江大学流体动力与机电系统国家重点实验室开放基金(GZKF-202012) 山东交通学院运输车辆检测、诊断与维修技术交通行业重点实验室开放基金(JTZL2101) 国家自然科学基金(52075303)。
关键词 拆解线平衡 社会工程算法 绿色设计 绿色制造 disassembly line balancing social engineering optimizer green design green manufacturing
  • 相关文献

参考文献2

二级参考文献23

  • 1GUNGOR A,GUPTA S M,POCHAMPALLY K,et al. Complications in disassembly line balancing [C]//Proceedings of SPIE. Bellingham, Wash. ,USA:SPIE,2001:289-298.
  • 2ALTEKIN F T, KANDILLER L, OZDEMIREL N E. Disassembly line balancing with limited supply and subassembly availability [C]//Proeeedings of SPIE. Bellingham, Wash. , USA: SPIE,2004 : 59-70.
  • 3AGRAWAL S, TIWARI M K. A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem[J].International Journal of Production Research, 2008,46(2) : 1405-1429.
  • 4MCGOVERN S M, GUPTA S M. 2-Opt heuristic for the disassembly line balancing problem[C]// Proceedings of SHE. Bellingham, Wash. , USA: SHE, 2004 : 71-84.
  • 5MCGOVERN S M, GUPTA S M. A balancing method and genetic algorithm for disassembly line balaneing[J]. European Journal of Operational Research,2007,179(3):692-708.
  • 6YAGMAHAN B, YENISEY M M. Ant colony optimization for multi-objective flow shop scheduling problem[J]. Computers and Industrial Engineering,2008,54(3):411-420.
  • 7GARCIA M C, CORDON O, HERRERA F. A taxonomy and an empirical analysis of multiple objective ant colony optimiza- tion algorithms for the bi-criteria TSP[J]. European Journal of Operational Research, 2007,180 ( 1 ) : 116-148.
  • 8DEB K, PRATAP A, AGARWAL S. A fast and elitist multiobjective genetic algorithm: NSGA-II [J]. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
  • 9BLUM C, BAUTISTA J, PEREIRA J. Beam-ACO applied to assembly line balancing[C]//Proceedings of the 5th International Workshop-ANTS2006. Berlin, Germany:Springer-Verlag, 2006:96 107.
  • 10KOWALCZUK Z, BIALASZEWSKI T. Niching mechanisms in evolutionary computations [J]. International Journal of Applied Mathematics and Computer Science, 2006, 16 (1): 59-84.

共引文献56

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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