Search

Robots are now widely used in product disassembly lines, which significantly improves end-of-life (EOL) product disassembly efficiency. Most of the current research on disassembly line balancing problems focuses on decomposing one product. More than one product can be disassembled concurrently, which can further improve the efficiency. Moreover, uncertainty such as the depreciation of EOL products, may result in disassembly failure. In this research, a stochastic multi-product robotic disassembly line balancing model is established using an AND/OR graph. It takes the precedence relationship, cycle constraint, and disassembly failure into consideration to maximize the profit and minimize the energy consumption for disassembling multiple products. A Pareto-improved multi-objective brainstorming optimization algorithm combined with stochastic simulation is proposed to solve the problem. Furthermore, by conducting experiments on some real cases and comparing with four state-of-the-art multi-objective optimization algorithms, i.e., the multi-objective discrete gray wolf optimizer, artificial bee colony algorithm, nondominated sorting genetic algorithm II, and multi-objective evolutionary algorithm based on decomposition, this paper validates its excellent performance in solving the concerned problem. [ABSTRACT FROM AUTHOR]

Selecting a set of reasonable milling parameters of computerized numerical control (CNC) machines is of great importance in decreasing energy consumption and enhancing processing productivity. However, existing works pay little attention to the optimization of energy-conscious milling parameters. This work establishes a dual-objective optimization model for the selection of milling parameters such that power consumption and process time are minimized. With multiple constraints of milling processing conditions, an improved artificial bee colony (ABC) intelligent algorithm is used to handle the proposed dual-objective optimization model. Compared with the non-dominated sorting genetic algorithm (NSGA-II), our improved algorithm has good performance. [ABSTRACT FROM AUTHOR]