登入選單
返回Google圖書搜尋
Integrating meta-heuristics and a Sarsa algorithm for disassembly scheduling problems with cycle time and hazard coefficients
註釋End-of-life products recycling can reduce the waste of resources, and disassembly line scheduling planning can effectively improve the recycling efficiency and reduce the pollution of the environment. This work addresses a bi-objective disassembly line scheduling problem with considering time interference between tasks. The weighted sum of the cycle time and hazard coefficients is optimized. First, a mathematical model of the disassembly line scheduling problem is established under the constraints of priority and time interference relationships. Second, four meta-heuristics are improved to solve the concerned problems, including particle swarm optimization, artificial bee colony, genetic algorithm and variable neighborhood search. Ten objective-oriented local search operations are designed for improving meta-heuristics’ performance. A reinforcement learning algorithm, Sarsa, is employed to guide task assignment among workstations and local search selection during iterations, respectively. Finally, experiments are carried out for 10 instances with different scales. The effectiveness of the improving strategies is verified; the meta-heuristics combined with Sarsa based task assignment and local search strategies has better robustness and stability than the classical ones. Comparisons and discussions show that the particle swarm optimization with improved strategies outperforms other algorithms.