Author:
Guo Laide,Peng Fangjie,Song Dapeng,Hu Chengbo,Dou Ling
Abstract
Abstract
In recent years, the utilization of end-of-life products which may cause serious environmental pollution has received much attention from both industrial and academia. The recycling and reusing of waste products have an essential step that is disassembly. A disassembly sequencing planning problem is studied with minimizing disassembly time to get the near-optimal solution. This work uses an improved algorithm for solving disassembly sequencing problems based on an improved gray wolf optimization algorithm, which has a group optimization options that can simulate the gray wolfs’ predation behaviours. An initial solution generator, a new solution generator, and a random mutation operator are adopted to improve the proposed algorithm, which can promote its efficiency and effectiveness. Experimental data show its superiority to solve this work’s problem comparing with the classical genetic algorithm.
Subject
General Physics and Astronomy
Reference24 articles.
1. Carbon emissions and energy effects on manufacturing–remanufacturing inventory models;Bazan;Comput. Ind. Eng.,2015
2. Time-based disassembly method: how to assess the best disassembly sequence and time of target components in complex products;Mandolini;Int. J. Adv. Manuf. Tech.,2018
3. Applying data mining technique to disassembly sequence planning: a method to assess effective disassembly time of industrial products;Marconi,2018
4. Disassembly Sequence Planning Using a Simplified Teaching-Learning-Based Optimization Algorithm;Xia,2018
5. Dual-Objective Program and Scatter Search for the Optimization of Disassembly Sequences Subject to Multiresource Constraints;Guo;IEEE Trans. Auto. Sci. Eng.,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献