A sinusoid size ring structure Quantum Evolutionary Algorithm

This paper proposes a dynamic ring architecture of interaction among members of population in a quantum evolutionary algorithms (QEA). The ring is allowed to expand/collapse based on a sinusoidal population size and partial re-initialization of new members in the population. The study shows that the ring structure can be an efficient architecture for an effective exploration/exploitation tradeoff, and the partial re-initialization of the proposed algorithm can improve the diversity of the algorithm. The proposed approach is tested on knapsack problem, trap problem as well as 14 numerical optimization functions. Experimental results show that the proposed structure consistently improves the performance of QEA.