A Differentiating Evolutionary Computation Approach for the Multidimensional Knapsack Problem
In this paper, the DEC (Differentiating Evolutionary Computation) algorithm is presented for solving a zero-one multidimensional knapsack problem. It has three new improvements. They are the use of a chromosome bank for elitism, the use of the superior clan and the inferior clan to improve exploitation and exploration, and the use of genetic modification to enable faster convergence. The experimental results have shown that the DEC algorithm is better than a greedy algorithm and a generic genetic algorithm. It can find solutions very close to those found by the algorithm proposed by Chu & Beasley.
Keywordsmultidimensional knapsack problem evolutionary computation genetic algorithm DEC algorithm
Unable to display preview. Download preview PDF.
- 1.Petersen, C.C.: Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects. Management Science, 736 (1967)Google Scholar
- 3.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Swiss Federal Institute of Technology (ETH) Zurich, Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering (2001)Google Scholar
- 5.Shao, Y., Xu, H., Yin, W.: Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm. In: IEEE 2009 International Workshop on Intelligent Systems and Applications (ISA), pp. 1–4 (2009)Google Scholar
- 6.Lin, C.: A Heuristic Genetic Algorithm Based on Schema Replacement for 0-1 Knapsack Problem. In: 2010 Fourth International Conference on Genetic and Evolutionary Computing (ICGEC), Shenzhen, China, pp. 301–304 (2010)Google Scholar
- 9.Beasley, J.: OR-Library, Multidimensional knapsack problem, http://people.brunel.ac.uk/~mastjjb/jeb/orlib/mknapinfo.html