Evolutionary algorithms for constrained engineering problems
Computers and Industrial Engineering
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
A new repair method based on QEA for 0/1 knapsack problems is proposed. In this approach, the qubit chromosome is used as heuristic knowledge to evaluate each element for the knapsack. The main idea is to delete the knapsack elements in the ascending order of qubit chromosome's probability value whilst avoid violating the constraints on its capacity. To minimize the influence of initialization, three different methods are adopted for obtaining the initial probability. Experimental results showed that the proposed method is promising.