Considering that the Quantum--inspired evolutionary algorithm (QEA) is useful to binary coding problems, but useless to military coded prob1ems, a novel evolutionary algorithm called Mu1tinary Compound States of Probability Angle COded Quantum--lnspired Evolutionary Algorithm (MQEA) is proposed in this paper. In the algorithm, the probability angle is used to represent the individual, instead of the probabi1ity amplitude which is used in QEA. The random observation method is used to obtain the observing individual. ln the individual's updating, the probability angles of the individual increase or decrease according to the observing individual's fitness compared with the current best solution's fitness. MQEA can be used in the problems with multinary coding. The experimental results show that MQEA has apparent superiority to QEA and the Conventional Genetic Algorithm (CGA) in application area, searching ability and computing tlme.
Considering that the Quantum--inspired evolutionary algorithm (QEA) is useful to binary coding problems, but useless to military coded prob1ems, a novel evolutionary algorithm called Mu1tinary Compound States of Probability Angle COded Quantum--lnspired Evolutionary Algorithm (MQEA) is proposed in this paper. In the algorithm, the probability angle is used to represent the individual, instead of the probabi1ity amplitude which is used in QEA. The random observation method is used to obtain the observing individual. ln the individual's updating, the probability angles of the individual increase or decrease according to the observing individual's fitness compared with the current best solution's fitness. MQEA can be used in the problems with multinary coding. The experimental results show that MQEA has apparent superiority to QEA and the Conventional Genetic Algorithm (CGA) in application area, searching ability and computing tlme.
A novel evolutionary algorithm called Probability Evolutionary Algorithm (PEA) is proposed, which is inspired by the Quantum computation and Quantum-inspired Evolutionary Algorithm (QEA). The individual in PEA is encoded by a probabilistic superposed bit which can represent a linear superposition of the states 0 to k (k ≥ 1). The observing step is used in PEA to obtain the observed individual, and the update method is used to evolve the population. The function optimization and 0-k knapsack problem experiments show that PEA has apparent superior in application area, searching capability and computation time compared with QEA and canonical genetic algorithm (CGA).
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.
In this paper, we propose a novel quantum-inspired evolutionary algorithm, called NQEA, for solving combinatorial optimization problems. NQEA uses a new Q-bit update operator to increase the balance between the exploration and exploitation of the search space. In the operator, first, the Q-bits of each individual in the population are updated based on the personal best measurement of that individual and the best measurement of current generation. Then, a restriction is applied to each Q-bit to prevent the premature convergence of its values. The results of experiments on the 0-1 knapsack and NK-landscapes problems show that NQEA performs better than a classical genetic algorithm, CGA, and two quantum-inspired evolutionary algorithms, QEA and vQEA, in terms of convergence speed and accuracy.
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superposition. In this paper, we propose a multi-start quantum-inspired evolutionary algorithm, called MSQIEA. To improve the performance of the algorithm, a multi-measurement operator and a new strategy for updating the rotation angle is proposed. When Q-bit individuals start to converge to their final states, the best solution is stored and all Q-bits in each Q-bit individual are reinitialized. We compare the effectiveness of MSQIEA with a popular quantum-inspired evolutionary algorithm, called QEA, for solving 0-1 knapsack problem. The experimental results show that MSQIEA outperforms QEA and finds a solution with higher profit.
Through the study of the quantum computing theory and binary coded quantum-inspired evolutionary algorithm, a new real-coded quantum-inspired evolutionary algorithm mode-double parameters real-coded quantum-inspired evolutionary algorithm mode is proposed.When it is applied to the genetic algorithm,a double parameter real-coded quantum genetic algorithm(DRQEA) is obtained.As a result,the binary to decimal conversion and complicated calculation of quantum gate in the quantum bit coded quantum genetic algorithm(QEA) is avoided. Simulation results show that compared with QEA,DRQEAhas lower time complexity,more global search ability which confirms the effectiveness of double parameters real-coded mode.
Abstract: This paper introduces quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function and the population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits.