{'fraction_non_alphanumeric': 0.0221147201105736, 'fraction_numerical': 0.0, 'mean_word_length': 5.241379310344827, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Genetic algorithm for disassembly strategy definition

The paper presents the application of a genetic algorithm to determine strategies for disassembly of products that have reached the end of their life. First, a general outline of the proposed methodology is provided and the features and specific properties of the genetic algorithm are described. Then an analysis of the algorithm's behaviour is carried out based on different problems. Once product structure is acquired, feasible disassembly alternatives may be determined; the domain of solutions may then be analysed through the genetic algorithm. First of all, a 'population' of acceptable solutions is randomly generated; then these solutions are estimated based on the criteria of the highest recovery value and the minimisation of discharged parts: genetic mutation and crossover operators are applied to the current population in order to generate a new population as a substitute to the previous one. Some cycles are made estimating, each time, the goodness of each individual solution and its probability to 'reproduce' itself. At the end, the best-rated alternative becomes the solution of the algorithm. The solution of the algorithm is compared to the one provided by a 'best-first' algorithm (providing the optimal solution), for different types of products. In the paper, the efficacy of the proposed methodology is analysed, in terms of type of solution and computation time.