Improved genetic algorithm based on rule optimization strategy for fibre allocation

Abstract

ABSTRACTIn modern manufacturing industry, in order to adapt to changes in the general environment, the manufacturing industry must improve production efficiency. To this end, this article introduces an improved genetic algorithm based on rule selection to tackle the nondeterministic polynomial hard problem stemming from inventory fibre resources and fibre selection principles in optical cable production. The algorithm aims to maximize inventory score and minimize fibre segmentation rate. It employs a permutation encoding approach to link the genetic algorithm with fibre allocation solutions and applies a self-attention mechanism to determine subset solution weight within each solution. To boost the recombination of favourable gene segments from different chromosomes, a rule optimization strategy is integrated into the crossover operation based on the weights. This operations enhance the algorithm's global search capability and convergence speed. A feasibility repair strategy is then used to inspect and rectify chromosomes, preventing the generation of illegal solutions. The legitimate mutation operation, founded on weight optimization rules, effectively reduces the algorithm's running time by avoiding illegal solutions. By leveraging actual production data from an optical cable manufacturer for simulation, the experimental results confirm the effectiveness of the improved genetic algorithm in addressing the fibre allocation problem. Comparative simulations with the unimproved genetic algorithm and a stepwise greedy algorithm underscore the superiority of the improved genetic algorithm in resolving the fibre allocation problem.

Keywords

• Fibre segmentation rate
• self-attention mechanism
• permutation encoding
• feasibility repair
• genetic algorithm