Multi-objective discrete salp swarm optimizer for solving multiple-product U-shaped disassembly line balancing problem

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The disassembly line balancing problem is one of the most significant methods in handling large quantities of waste electrical and electronic equipment efficiently problems. In this paper, we propose a U-shaped layout disassembly line and set up a mathematical model to maximize the disassembly profit and minimize the disassembly time of hazardous parts. Therefore, an improved Multi-objective Salp swarm algorithm based on Pareto which combines with a stochastic simulation method is proposed to solve such a U-shaped disassembly line balancing problem. Some cases are used to verify the effectiveness of the proposed method. The results show the proposed method can solve the U-shaped disassembly line balancing problem and outdo the other two optimization algorithms: Nondominated Sorting Genetic Algorithm-II (NSGA-II) and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) in the quality of solutions.

Cite

CITATION STYLE

APA

Li, J., Guo, X., Peng, F., Qi, L., & Qin, S. (2021). Multi-objective discrete salp swarm optimizer for solving multiple-product U-shaped disassembly line balancing problem. In Journal of Physics: Conference Series (Vol. 2024). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/2024/1/012047

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free