A Weight-coded Evolutionary Algorithm for the Multidimensional Knapsack Problem
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm proposed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem
The 0/1 multidimensional knapsack problem is the 0/1 knapsack problem with m constraints which makes it difficult to solve using traditional methods like dynamic programming or branch and bound algorithms. We present a g…
C++ codeSpecific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem
The chance-constrained knapsack problem is a variant of the classical knapsack problem where each item has a weight distribution instead of a deterministic weight. The objective is to maximize the total profit of the sel…
Evolutionary AlgorithmsSimulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem
The multiple choice multidimensional knapsack problem (MCMK) is a harder version of the 0/1 knapsack problem, and is ever more complex than the 0/1 multidimensional knapsack problem. In MCMK, there are several groups of …
AllC++ codeMultiple-choiceFinding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
The 0-1 Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem with many engineering applications. In this paper, we propose a novel algorithm combining evolutionary computation…
Combinatorial OptimizationA Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem
Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms can produce good solutions to the 0-1 knapsack problem. Nonetheless, few rigorous invest…
Evolutionary Algorithms