Quantum Binary Shuffled Frog Leaping Algorithm

A quantum binary shuffled frog leaping algorithm (QBSFLA) is proposed through integrating the theories of the quantum evolutionary algorithm and the shuffled frog leaping algorithm (SFLA). Firstly, the superposition state characteristic of quantum makes the separate individual expresses more states, and the probability expression characteristic makes individuals´ states are expressed with certain probability for increasing the diversity of the population potentially. Then, SFLA is used to regulate the phrase of the quantum bit to achieve a balance of the local and global search and improve the run speed. The experi-mental results of three 0-1 knapsack problems solved by QBSFLA with the greedy algorithm show that QBSFLA has several advantages such as fast convergence, powerful global search ability and good stability.