Multi-objective optimization for U-shaped disassembly line balancing problem with stochastic operation times

被引:0
|
作者
Zhang Z. [1 ]
Wang K. [1 ]
Li L. [1 ]
Mao L. [1 ]
机构
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
基金
中国国家自然科学基金;
关键词
Artificial fish swarm algorithm; Multi-objective optimization; Pareto set; Simulated annealing algorithm; Stochastic operation times; U-shaped disassembly line balancing;
D O I
10.13196/j.cims.2018.01.009
中图分类号
学科分类号
摘要
To better reflect the uncertainty of actual disassembly task time, a multi-objective U-shaped mathematical model of disassembly line balancing problem was formulated by considering the stochastic operation times. A Pareto based hybrid artificial fish swarm algorithm was proposed for overcoming the deficiency that failure to balance each objective of traditional method in solving multi-objective problems. For reducing the repeated search in parallel foraging of fish swarm, a serial foraging way adopting the self-adaptive visual field was introduced, and the introduction of Pareto non-inferior solutions set realized the diversity of fish swarm optimization results. A simulated annealing operation was operated on the sequence results which could avoid the local optimum. In addition, the crowding distance was employed as an evaluation mechanism to filter and retain the elite solutions. Furthermore, the elite solutions were added to the next iteration of population which speeded up the convergence rate. The proposed algorithm was applied to one certain printer disassembly instance including 55 disassembly tasks. The effectiveness and superiority were validated through the comparison of proposed algorithm with basic artificial fish swarm algorithm and simulated annealing algorithm. © 2018, Editorial Department of CIMS. All right reserved.
引用
收藏
页码:89 / 100
页数:11
相关论文
共 22 条
  • [1] Circular of the State Council on printing and issuing the “Made in China 2025” plan
  • [2] Gungor A., Gupta S.M., Disassembly line in product recovery, International Journal of Production Research, 40, 11, pp. 2569-2589, (2002)
  • [3] Avikal S., Mishra P.K., Jain R., A fuzzy AHP and PROMETHEE method-based heuristic for disassembly line balancing problems, International Journal of Production Research, 52, 5, pp. 1306-1317, (2014)
  • [4] Bentaha M.L., Battaia O., Dolgui A., Lagrangian relaxation for stochastic disassembly line balancing problem, Procedia CIRP, 17, pp. 56-60, (2014)
  • [5] Mcgovern S.M., Gupta S.M., A balancing method and genetic algorithm for disassembly line balancing, European Journal of Operational Research, 179, 3, pp. 692-708, (2007)
  • [6] Zhu X., Zhang Z., Zhu X., Et al., An ant colony optimization algorithm for multi-objective disassembly line balancing problem, China Mechanical Engineering, 25, 8, pp. 1075-1079, (2014)
  • [7] Kalayci C.B., Gupta S.M., A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem, The International Journal of Advanced Manufacturing Technology, 69, 1-4, pp. 197-209, (2013)
  • [8] Kalayci C.B., Gupta S.M., Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem, Expert Systems with Applications, 40, 18, pp. 7231-7241, (2013)
  • [9] 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)
  • [10] Tuncel E., Zeid A., Kamarthi S., Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning, Journal of Intelligent Manufacturing, 25, 4, pp. 647-659, (2014)