An evaluation methodology for disassembly processes
Proceedings of the 21st international conference on Computers and industrial engineering
Linear programming in disassembly/clustering sequence generation
Computers and Industrial Engineering - Special issue on o/perational issues in environmentally conscious manufacturing
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Determining optimum disassembly sequences in electronic equipment
Computers and Industrial Engineering
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Disassembly sequence planning in a disassembly cell context
Robotics and Computer-Integrated Manufacturing
A path-relinking approach for a bi-criteria disassembly sequencing problem
Computers and Operations Research
| Hi-index | 0.01 |
One of the most difficult problems faced by OR researchers in the reverse logistics field consists in determining an efficient disassembly sequence for a product at its end of life. In this paper, a scatter search (SS) metaheuristic is presented aiming to deal with the optimum disassembly sequence problem for the case of complex products with sequence-dependent disassembly costs, and assuming that only one component can be released at each time. The algorithm was tested over a set of 48 products consisting of 25, 50, 75 and 100 right-angled parallelepiped components, connected by different kinds of joints. A feasible disassembly sequence, consisting on the reverse of the assembly sequence, is always usable. Comparing by using some statistical analysis the costs of the sequence proposed by the SS algorithm with those corresponding to the reverse order, efficiency of the metaheuristic is shown up.