Parallel Improved Quantum Evolutionary Algorithm for Complex Optimization Problems

As for the problems of premature convergence, slow convergence and long computing time in solving complex continuous function optimization by traditional quantum evolutionary algorithm, a dynamic parallel quantum evolutionary algorithm for solving complex continuous function optimization problem is proposed in this paper. Multi population co-evolution is adopted, and each sub-population evolves in different search areas according to their own evolution objectives to form a parallel search mode, which can speed up the algorithm convergence and avoid premature convergence; Quantum computation is introduced into the differential evolution algorithm. In this method, the probability amplitude representation of qubits is applied to the real number coding of chromosomes, the chromosome position is updated by quantum mutation, quantum crossover and quantum selecting operations, the two probability amplitudes of qubits are exchanged by quantum non-gate, and an adaptive operator is introduced to improve the population diversity, It can not only prevent the premature convergence of the algorithm, but also make the algorithm converge faster and improve the problem-solving ability of the optimization algorithm. Taking the function extreme value problem as an example, the effectiveness of the algorithm is verified by this algorithm.