Modeling and Optimization for Two-sided Disassembly Line Balancing Problems

被引:4
|
作者
Zou B. [1 ]
Zhang Z. [1 ]
Li L. [1 ]
Cai N. [1 ]
机构
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
来源
Zhang, Zeqiang (zzq_22@163.com) | 2018年 / Chinese Mechanical Engineering Society卷 / 29期
关键词
Bat algorithm; Disassembly line balancing problem; Pareto; Two-sided layout;
D O I
10.3969/j.issn.1004-132X.2018.09.013
中图分类号
学科分类号
摘要
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. © 2018, China Mechanical Engineering Magazine Office. All right reserved.
引用
收藏
页码:1090 / 1097and1107
相关论文
共 22 条
  • [21] Deb K., Pratap A., Agarwal S., Et al., A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ, IEEE Transactions on Evolutionary Computation, 2, pp. 182-197, (2002)
  • [22] Kalayci C.B., Gupta S.M., Simulated Annealing Algorithm for Solving Sequence-dependent Disassembly Line Balancing Problem, IFAC Proceedings Volumes, 46, 9, pp. 93-98, (2013)