Optimizing Disassembly Line Balancing Problem Using Multi-objective ADAM Optimizer Algorithm
DOI:
https://doi.org/10.54388/jkues.v1i1.15Keywords:
Disassembly line balancing, Pareto set, ADAM optimizer, Multi-objective ADAM optimizer algorithmAbstract
Disassembly for the end of life products considered a very important issue nowadays, to keep an environment is clean as much as possible and reduce pollution by reducing industrial waste, the disassembly line is to solve this problem, but the disassembly line is facing more problems such as smoothness of workload in workstations, hazard parts in disassembly products, etc. To optimize these problems in the disassembly line, we proposed a multi-objective ADAM optimizer algorithm to optimize and balance the objectives. An automatic disassembly line is assumed to increase disassembly processes rather than manually. The mathematical model embedded in the proposed algorithm simulated in default disassembly line, a Pareto set used to detect for non-inferior solutions in the algorithms, and the results indicated to improve the productivity of between 400% to 500%, reduced the energy consumption between 50% to 75%, reducing the number of workstations between 80% to 95%, and reduced cycle time between 70% to 85%.
References
S. Gupta and A. Gungor, “Product recovery using a disassembly line: challenges and solution,” in Proceedings of the 2001 IEEE International Symposium on Electronics and the Environment. 2001 IEEE ISEE (Cat. No.01CH37190). IEEE. [Online]. Available: https://doi.org/10.1109%2Fisee.2001.924499
S. M. Gupta, E. Erbis, and S. M. McGovern, “Disassembly sequencing problem: a case study of a cell phone,” S. M. Gupta, Ed.,Philadelphia, PA, Dec. 2004, pp. 43–52. [Online]. Available: http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=851852
S. M. Mcgovern and S. M. Gupta, “Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem,” International Journal of Production Research, vol. 45, no. 18-19, pp. 4485–4511, Sep. 2007. [Online]. Available: HTTP://www.tandfonline.com/doi/abs/10.1080/00207540701476281
S. McGovern and S. Gupta, “Greedy algorithm for disassembly line scheduling,” in SMC’03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), vol. 2. Washington, DC, USA: IEEE, 2003, pp. 1737–1744. [Online]. Available: http://ieeexplore.ieee.org/document/1244663/
S. M. McGovern and S. M. Gupta, “2-opt heuristic for the disassembly line balancing problem,” S. M. Gupta, Ed., Providence, RI, Feb. 2004, pp. 71–84. [Online]. Available: http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=833581
S. M. McGovern and S. M. Gupta, “Combinatorial optimization methods for disassembly line balancing,” S. M. Gupta, Ed., Philadelphia, PA, Dec. 2004, pp. 53–66. [Online]. Available: http://proceedings.spiedigitallibrary.org/proceeding.
aspx?articleid=851853
F. T. Altekin, L. Kandiller, and N. E. Ozdemirel, “Profit-oriented disassembly-line balancing,” International Journal of Production Research, vol. 46, no. 10, pp. 2675–2693, May 2008. [Online]. Available: http://www.tandfonline.com/doi/abs/10.1080/00207540601137207
M. L. Bentaha, O. Battaa, and A. Dolgui, “Chance Constrained Programming Model for Stochastic ProfitOriented Disassembly Line Balancing in the Presence of Hazardous Parts,” in Advances in Production Management Systems. Sustainable Production and Service Supply Chains, V. Prabhu, M. Taisch, and D. Kiritsis, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, vol. 414, pp. 103–110, series Title: IFIP Advances in Information and Communication Technology. [Online]. Available: http://link.springer. com/10.1007/978-3-642-41266-0 13
S. McGovern and S. M. Gupta, The disassembly line: balancing and modeling. New York: McGraw-Hill, 2011, oCLC:
[Online]. Available: http://accessengineeringlibrary.com/ browse/disassembly-line-balancing-and-modeling
S. M. McGovern and S. M. Gupta, “A balancing method and genetic algorithm for disassembly line balancing,” European Journal of Operational Research, vol. 179, no. 3, pp. 692–708, Jun. 2007. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/ S0377221705007307
S. M. McGovern and S. M. Gupta, “Ant colony optimization for disassembly sequencing with multiple objectives,” The International Journal of Advanced Manufacturing Technology, vol. 30, no. 5-6, pp. 481–496, Sep. 2006. [Online]. Available: http://link.springer.com/10.1007/s00170-005-0037-6
C. B. Kalayci, S. M. Gupta, and K. Nakashima, “A Simulated Annealing Algorithm for Balancing a Disassembly Line,” in Design for Innovative Value Towards a Sustainable Society, M. Matsumoto, Y. Umeda, K. Masui, and S. Fukushige, Eds. Dordrecht: Springer Netherlands, 2012, pp. 714–719. [Online]. Available: http://link.springer.com/10.1007/978-94-007-3010-6 143
C. B. Kalayci and S. M. Gupta, “Ant colony optimization for sequencedependent disassembly line balancing problem,” Journal of Manufacturing Technology Management, vol. 24, no. 3, pp. 413–427, Mar. 2013. [Online]. Available: https://www.emerald.com/insight/content/doi/10.1108/17410381311318909/full/html
Z. A. il, S. Mete, and F. Serin, “Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach,” Applied Mathematical Modelling, vol. 86, pp. 335–348, Oct. 2020. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S0307904X20302249
K. Wang, X. Li, L. Gao, P. Li, and S. M. Gupta, “A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem,” Applied Soft Computing, vol. 107, p. 107404, Aug. 2021. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S1568494621003276
S. Mutlu and B. Gner, “A memetic algorithm for mixed-model twosided disassembly line balancing problem,”Procedia CIRP, vol. 98,pp. 67–72, 2021. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S2212827121000305
T. Yin, Z. Zhang, and J. Jiang, “A Pareto-discrete hummingbird algorithm for partial sequence-dependent disassembly line balancing problem considering tool requirements,” Journal of Manufacturing Systems, vol. 60, pp. 406–428, Jul. 2021. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S0278612521001424
L. Zhu, Z. Zhang, and C. Guan, “Multi-objective partial parallel disassembly line balancing problem using hybrid group neighbourhood search algorithm,” Journal of Manufacturing Systems, vol. 56, pp.252–269, jul 2020. [Online]. Available: https://doi.org/10.1016%2Fj.jmsy.2020.06.013
R. Usubamatov, A. M. Alwaise, and Z. M. Zain, “Productivity and optimization of section-based automated lines of parallel-serial structure with embedded buffers,” International Journal of Advanced Manufacturing Technology, vol. 65, no. 5-8, pp. 651–655, 2013.
Z. Li and M. N. Janardhanan, “Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem,” Expert Systems with Applications, vol. 183, p. 115431, Nov. 2021. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S0957417421008484
K. Gao, Z. He, Y. Huang, P. Duan, and P. Suganthan, “A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing,” Swarm and Evolutionary Computation, vol. 57, p. 100719, Sep. 2020. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S2210650220303722
L. Volchkevich, “Automation of production processes,” Mashinostroenie, Moscow, vol. 380, 2005.
L. Shi and S. Men, “Optimal buffer allocation in production lines,” vol. 35, no. 1, pp. 1–10. [Online]. Available: http://www.tandfonline. com/doi/abs/10.1080/07408170304431
I. Sabuncuoglu, E. Erel, and Y. Gocgun, “Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation,” vol. 44, no. 13, pp. 2499–2523. [Online]. Available: http://www.tandfonline.com/doi/abs/10.1080/00207540500465535
C. B. Kalayci and S. M. Gupta, “Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem,” Expert Systems with Applications, vol. 40, no. 18, pp. 7231–7241, Dec. 2013. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S0957417413004636
C. Kalayci, “Solving sequence-dependent disassembly line balancing problem using a hybrid genetic algorithm,” 012013.
C. B. Kalayci and S. 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, no. 1-4, pp. 197–209, Oct. 2013. [Online]. Available: http://link.springer.com/10.1007/s00170-013-4990-1
“River Formation Dynamics Approach for Sequence-Dependent Disassembly Line Balancing Problem,” in Reverse Supply Chains, 0th ed., S. M. Gupta, Ed. CRC Press, Apr. 2016, pp.307–330. [Online]. Available: https://www.taylorfrancis.com/books/9781439899038/chapters/10.1201/b13749-16
C. B. Kalayci and S. M. Gupta, “Simulated Annealing Algorithm for Solving Sequence-Dependent Disassembly Line Balancing Problem,” IFAC Proceedings Volumes, vol. 46, no. 9, pp. 93–98, 2013. [Online]. Available:https://linkinghub.elsevier.com/retrieve/pii/S1474667016342677
C. B. Kalayci and S. M. Gupta, “A tabu search algorithm for balancing a sequence-dependent disassembly line,”Production Planning & Control, vol. 25, no. 2, pp.149–160, Jan. 2014. [Online]. Available: https://www.tandfonline.com/doi/full/10.1080/09537287.2013.782949
C. B. Kalayci, O. Polat, and S. M. Gupta, “A variable neighbourhood search algorithm for disassembly lines,” Journal of Manufacturing Technology Management, vol. 26, no. 2, pp. 182–194, mar 2015. [Online]. Available: https://doi.org/10.1108%2Fjmtm-11-2013-0168
C. B. Kalayci, O. Polat, and S. M. Gupta, “A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem,” Annals of Operations Research, vol. 242, no. 2, pp. 321–354, Jul. 2016. [Online]. Available: http://link.springer.com/10.1007/s10479-014-1641-3
L. P. Ding, Y. X. Feng, J. R. Tan, and Y. C. Gao, “A new multi-objective ant colony algorithm for solving the disassembly line balancing problem,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 5-8, pp. 761–771, 2010
