Paper
14 February 2022 Multi-objective shuffled frog leading algorithm for human-robot collaborative disassembly line balancing problems
Author Affiliations +
Proceedings Volume 12161, 4th International Conference on Informatics Engineering & Information Science (ICIEIS2021); 121610D (2022) https://doi.org/10.1117/12.2626843
Event: 4th International Conference on Informatics Engineering and Information Science, 2021, Tianjin, China
Abstract
Disassembly line plays a crucial role in the recycling of end-of-life products, which can effectively reduce the pressure of resource shortage. Considering the development of intelligent plant, this paper studies the human-robot collaborative disassembly line balancing problem with the optimization objectives of maximizing total profit and minimizing energy consumption. The disassembly process is specified with the AND/OR graph model. In addition, a Pareto improved multiobjective shuffled frog leading algorithm is proposed, which introduces an elitist strategy to improve the searching ability. Finally, the proposed model and algorithm are applied to instances of human-robot collaborative disassembly lines. Through different comparison experiments with the nondominated sorting genetic algorithm II and harmony search, the superiority of the proposed algorithm in performance and quality is verified.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chenyang Fan, XiWang Guo, Jiacun Wang, Liang Qi, ShuJin Qin, and Gongdan Xu "Multi-objective shuffled frog leading algorithm for human-robot collaborative disassembly line balancing problems", Proc. SPIE 12161, 4th International Conference on Informatics Engineering & Information Science (ICIEIS2021), 121610D (14 February 2022); https://doi.org/10.1117/12.2626843
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Robots

Optimization (mathematics)

Mathematical modeling

Stochastic processes

Communication engineering

Computer programming

Genetic algorithms

Back to Top