论文信息 - Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems

Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems

Difficult knapsack problems are problems that are expressly designed to be difficult. In this paper, enhanced Quantum Evolutionary Algorithms are designed and their application is presented for the solution of the DKPs. The algorithms are general enough and can be used with advantage in other subset selection problems.

[1] Jong-Hwan Kim,et al. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[2] Paolo Toth,et al. Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems , 1997, Oper. Res..

[3] Jong-Hwan Kim,et al. Quantum-Inspired Evolutionary Algorithms With a New Termination Criterion , H Gate , and Two-Phase Scheme , 2009 .

[4] David Pisinger,et al. An expanding-core algorithm for the exact 0-1 knapsack problem , 1995 .

[5] Jong-Hwan Kim,et al. Quantum-inspired evolutionary algorithms with a new termination criterion, H/sub /spl epsi// gate, and two-phase scheme , 2004, IEEE Transactions on Evolutionary Computation.

[6] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[7] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[9] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .

[10] F. Heide. A polynomial linear search algorithm for the n-dimensional knapsack problem , 1983, STOC.