Improved wind driven optimization algorithm for multi-objective disassembly line balancing problem concerning human factors

被引:0
|
作者
Zhang Y. [1 ,2 ]
Zhang Z. [1 ,2 ]
Zeng Y. [1 ,2 ]
Cai N. [1 ,2 ]
机构
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
[2] Sichuan Provincial Key Laboratory of Technology and Equipment of Rail Transit Operation and Maintenance, Chengdu
基金
中国国家自然科学基金;
关键词
Disassembly line balancing; Human factors; Multi-objective optimization; Wind driven optimization algorithm;
D O I
10.13196/j.cims.2020.05.003
中图分类号
学科分类号
摘要
In view of the dependence of disassembly line on manual operation, a multi-objective mathematical model was built including the workstations number, the idle time equilibrium index, the disassembly cost and the number of workstations where the workers used standing posture four optimization objectives, and an improved wind driven optimization algorithm was presented to solve it. The corresponding relationship between the disassembly task and the air particle driven was set up by discretization wind driven optimization algorithm, and the variable neighborhood search strategy was used to expand search space. The Pareto set and the crowding distance mechanism were adopted to ensure the diversity of solution results. The feasibility and validity of the algorithm were verified by comparing with other algorithms using different scale examples. The proposed mathematical model and the presented algorithm were applied to the printer disassembly line, which reflected the rationality and superiority of the disassembly scheme considering human factors in disassembly line balancing problem. © 2020, Editorial Department of CIMS. All right reserved.
引用
收藏
页码:1172 / 1184
页数:12
相关论文
共 31 条
  • [1] XIA Xuhui, ZHOU Meng, WANG Lei, Et al., Remanufacturing disassembly service line and the balancing optimization method, Computer Integrated Manufacturing Systems, 24, 10, pp. 2492-2501, (2018)
  • [2] IlGIN M A, GUPTA S M., Environmentally conscious manufacturing and product recovery(ECMPRO): a review of the state of the art, Journal of Environmental Management, 91, 3, pp. 563-591, (2010)
  • [3] GUNGOR A, GUPTA S M, POCHAMPALLY K, Et al., Complications in disassembly line balancing, Proceedings of SPIE-The International Society for Optical Engineering, 4193, pp. 289-298, (2001)
  • [4] MCGOVERN S M, GUPTA S M., 2-opt heuristic for the disassembly line balancing problem, Proceedings of SPIE-The International Society for Optical Engineering, 5262, pp. 71-84, (2003)
  • [5] AVIKAL S, JAIN R, YADAV H, Et al., A new heuristic for disassembly line balancing problems with AND/OR precedence relations, pp. 519-525, (2014)
  • [6] KOC A, SABUNCUOGLU I, EREL E., Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph, IIE Transactions, 41, 10, pp. 866-881, (2009)
  • [7] MCGOVERN S M, GUPTA S M., Ant colony optimization for disassembly sequencing with multiple objectives, International Journal of Advanced Manufacturing Technology, 30, 5, pp. 481-496, (2006)
  • [8] KALAYCI C B, GUPTA S M., A particle swarm optimization algorithm for solving disassembly line balancing problem, Proceedings for the Northeast Region Decision Sciences Institute, 69, 1, pp. 197-209, (2013)
  • [9] KALAYCI C B, GUPTA S M., A tabu search algorithm for balancing a sequence-dependent disassembly line, Production Planning & Control, 25, 2, pp. 149-160, (2014)
  • [10] KALAYCI C B, POLAT O, GUPTA S M., A variable neighbourhood search algorithm for disassembly lines, Journal of Manufacturing Technology Management, 26, 2, pp. 182-194, (2015)