A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem
作者： Kaipu Wang , Xinyu Li , Liang Gao
DOI: 10.1016/J.CIE.2019.03.017
关键词: Set (abstract data type) 、 Pollination 、 Heuristic 、 Workload 、 Algorithm 、 Heuristic (computer science) 、 Energy consumption 、 Production line 、 Pareto principle 、 Computer science 、 Line (geometry)
摘要: Abstract Two-sided production line can utilize both the left and right stations to increase productivity of large-sized products. For disassembly waste products such as cars buses, two-sided layout is introduced into line. This paper constructs a mathematical model stochastic partial balancing with multi-objective, multi-constraint uncertainty. The aim optimize number stations, workload smoothness, energy consumption profit simultaneously. A multi-objective discrete flower pollination algorithm based on Pareto dominance relations proposed optimization method problem. In order improve quality initial solutions, four heuristic rules combining characteristics problem are designed. effectiveness superiority verified by solving set test problems, application capabilities have also been verified.
sci-hub.se 参考文章(37)
Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui, S. Jack Hu, Second order conic approximation for disassembly line design with joint probabilistic constraints European Journal of Operational Research. ,vol. 247, pp. 957- 967 ,(2015) , 10.1016/J.EJOR.2015.06.019
Uğur Özcan, Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm European Journal of Operational Research. ,vol. 205, pp. 81- 97 ,(2010) , 10.1016/J.EJOR.2009.11.033
S. M. Mcgovern, S. M. Gupta, Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem International Journal of Production Research. ,vol. 45, pp. 4485- 4511 ,(2007) , 10.1080/00207540701476281
Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui, An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times International Journal of Production Research. ,vol. 53, pp. 1807- 1818 ,(2015) , 10.1080/00207543.2014.961212
Li-Ping Ding, Yi-Xiong Feng, Jian-Rong Tan, Yi-Cong Gao, A new multi-objective ant colony algorithm for solving the disassembly line balancing problem The International Journal of Advanced Manufacturing Technology. ,vol. 48, pp. 761- 771 ,(2010) , 10.1007/S00170-009-2303-5
Hu Xiaofeng, Wu Erfei, Bao Jinsong, Jin Ye, A branch-and-bound algorithm to minimize the line length of a two-sided assembly line European Journal of Operational Research. ,vol. 206, pp. 703- 707 ,(2010) , 10.1016/J.EJOR.2010.02.034
Xiaofeng Hu, Erfei Wu, Ye Jin, A station-oriented enumerative algorithm for two-sided assembly line balancing European Journal of Operational Research. ,vol. 186, pp. 435- 440 ,(2008) , 10.1016/J.EJOR.2007.01.022
Shwetank Avikal, Rajeev Jain, P.K. Mishra, A Kano model, AHP and M-TOPSIS method-based technique for disassembly line balancing under fuzzy environment soft computing. ,vol. 25, pp. 519- 529 ,(2014) , 10.1016/J.ASOC.2014.08.002
Seamus M. McGovern, Surendra M. Gupta, Ant colony optimization for disassembly sequencing with multiple objectives The International Journal of Advanced Manufacturing Technology. ,vol. 30, pp. 481- 496 ,(2006) , 10.1007/S00170-005-0037-6
Can B. Kalayci, Surendra M. Gupta, A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem The International Journal of Advanced Manufacturing Technology. ,vol. 69, pp. 197- 209 ,(2013) , 10.1007/S00170-013-4990-1