Disassembly Line Balancing Design for Mixed-Model Disassembly Process Using a Modified Metaheuristic Approach

Article Sidebar

PDF
Published: Dec 17, 2025
Keywords:
Disassembly line Mixed-model Metaheuristics Particle swarm optimization Multi objective

Main Article Content

Arnat Watanasungsuit
Hydrocarbon Solutions (Thailand) Co., Ltd. Thawi Wattana, Bangkok 10170, Thailand
Peerapop Jomtong
Department of Biomedical Engineering, Faculty of Health Sciences, Christian University, Nakhon Pathom 73000, Thailand
Choat Inthawongse
Program in Smart Manufacturing Technology, Faculty of Industrial Technology, Muban Chom Bueng Rajabhat University, Ratchaburi 70150, Thailand
Choosak pornsing
Department of Industrial Engineering and Management, Faculty of Engineering and Industrial Technology, Silpakorn University, Nakhon Pathom 73000, Thailand

Abstract

This study has two main objectives: to propose a mathematical model for the mixedmodel disassembly line balancing problem and to develop a customized solving technique. The model aims to minimize the disassembly line length and the number of opened stations while maximizing workload smoothness in a two-sided disassembly line. The solver, based on the particle swarm optimization (PSO) algorithm, was enhanced through a new discretization method and the survival sub-swarm PSO strategy, enabling it to handle multi objective optimization via Pareto optimality for constructing the elite list. To validate the approach, experiments were conducted on a top-loaded washing machine with different takt times (71, 80, 90, and 100 seconds). Four competitive algorithms—NSGA-II, SPEA2, BARON, and MINLP—were used for comparison. Performance was evaluated using three indicators: inverted generational distance (𝐼𝐺𝐷), hypervolume (𝐻𝑉), and ratio (𝑅). The results showed that the proposed method consistently outperformed the other algorithms, achieving superior accuracy, efficiency, and stability in delivering optimal and reliable solutions.

Article Details

How to Cite
Arnat Watanasungsuit, Peerapop Jomtong, Inthawongse, C., & pornsing, C. (2025). Disassembly Line Balancing Design for Mixed-Model Disassembly Process Using a Modified Metaheuristic Approach. Science & Technology Asia, 30(4), 303–322. retrieved from https://ph02.tci-thaijo.org/index.php/SciTechAsia/article/view/257843
Issue
Vol.30 No.4 (October-December 2025)
Section
Engineering
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

References

Özceylan E, Kalayci CB, Güngör A, Gupta SM. Disassembly line balancing problem: a review of the state of the art and future directions. Int J Prod Res. 2019;57(15-16):4805–27.

Güngör A, Gupta SM. Disassembly line in product recovery. Int J Prod Res. 2002;40(11):2569–89.

Gupta SM, Taleb KN. Scheduling disassembly. Int J Prod Res. 1994;32(8):1857–66.

Ghandi S, Masehian E. Review and taxonomies of assembly and disassembly path planning problems and approaches. Comput Aided Des. 2015;67:58–86.

Güngör A, Gupta SM, Pochampally K, Kamarthi SV. Complications in disassembly line balancing. In: Environmentally Conscious Manufacturing. Vol. 4193. SPIE; 2001. p. 289–98.

Altekin FT, Akkan C. Task-failure-driven rebalancing of disassembly lines. Int J Prod Res. 2012;50(18):4955–76.

McGovern SM, Gupta SM. Disassembly Line Balancing. In: Environment Conscious Manufacturing. CRC Press; 2007. p. 235–310.

Hu Y, Xu Y, Jia Y. Review of the optimization algorithms for remanufacturing disassembly line. In: Proc 26th Int Conf Automation and Computing (ICAC). IEEE; 2021. p. 1–6.

McGovern SM, Gupta SM. Disassembly Line: Balancing and Modelling. New York: McGraw-Hill; 2011.

Opalić M, Kljajin M, Vuĉković K. Disassembly layout in WEEE recycling process. Strojarstvo. 2010;52(1):51–8.

Mutlu S, Güner B. A memetic algorithm for mixed-model two-sided disassembly line balancing problem. Procedia CIRP. 2021;98:67–72.

Liang J, Guo S, Xu W. Balancing stochastic mixed-model two-sided disassembly line using multiobjective genetic flatworm algorithm. IEEE Access. 2021;9:138067–81.

Laili Y, Wang Y, Fang Y, Pham DT. Solutions for mixed-model disassembly line balancing with multi-robot workstations. In: Optimisation of Robotic Disassembly for Remanufacturing. 2022. p. 153–80.

Chao B, Liang P, Zhang C, Guo H. Multiobjective optimization for mixed-model two-sided disassembly line balancing problem considering partial destructive mode. Mathematics. 2023;11(6):1299.

Kennedy J, Eberhart R. Particle swarm optimization. In: Proc ICNN’95 – Int Conf Neural Networks. Vol. 4. IEEE; 1995. p. 1942–8.

Pornsing C, Sangkhiew N, Sakonwittayanon P, Jomtong P, Ohmori S. A new discretization technique for enhancing discrete particle swarm optimization’s performance. Sci Technol Asia. 2022;27(3):204–15.

Pornsing C, Sodhi MS, Lamond BF. Novel self-adaptive particle swarm optimization methods. Soft Comput. 2016;20:3579–93.

Forti V, Baldé CP, Kuehr R, Bel G. The Global E-Waste Monitor 2020. Bonn/Geneva/Rotterdam: United Nations University (UNU), International Telecommunication Union (ITU) & International Solid Waste Association (ISWA); 2020.

Tongchan T, Pomsing C, Tonglim T. Harmony search algorithm’s parameter tuning for traveling salesman problem. In: Proc Int Conf Robotics and Automation Sciences (ICRAS). IEEE; 2017. p. 199–203.

Zuo X, Chen C, Tan W, Zhou M. Vehicle scheduling of an urban bus line via an improved multiobjective genetic algorithm. IEEE Trans Intell Transp Syst. 2014;16(2):1030–41.

Deb K, Pratap A, Agarwal S, Meyarivan TA. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput. 2002;6(2):182–97.

Zhou A, Zhang Q, Zhang G. A multiobjective evolutionary algorithm based on decomposition and probability model. In: Proc IEEE Congress on Evolutionary Computation. IEEE; 2012. p. 1–8.