This paper presents an accelerated implementation of the discrete shuffled frog leaping algorithm (DSFLA) to solve 0/1 Knapsack Problem, an important class of combinatorial optimization problems. The DSFLA is known for its numerical stability, but, as the number of objects in the dataset increases...
New binary bat algorithm for solving 0-1 knapsack problem. Complex Intelligent Syst.M. Rizk, Rizk-Allah, Aboul Ella Hassanian, New binary bat algorithm for solving 0-1 Knapsack problem, Complex. Intell. Syst., 4 (2018), 31-53. https://doi.org/10.1007/s40747-017-0050-z...
An efficient tabu search approach for the 0–1 multidimensional knapsack problem In this paper, we describe a new approach to tabu search (TS) based on strategic oscillation and surrogate constraint information that provides a balance b... S Hanafi,A Freville - 《European Journal of Operational...
This paper proposes a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving 0–1 quadratic knapsack problems. This is a combinatorial optimization problem, which arises in many fields of optimization. In S-bAFSA, trial points are created by using crossover and ...
Because the value and size of items and the size of knapsack can change along with the time, it causes that solving this problem is more difficult. We proposed an efficient algorithm for solving RTVKP with dynamic size of knapsack based on dynamic programming method, and analyzed the ...
SYSTOLIC ARRAYPARALLEL ALGORITHMTREEKNAPSACK PROBLEMA systolic algorithm for solving the O/1-knapsack problems with n items is presented. The computational model used is a tree structure which consists of 2(n) identical processing elements (PEs). Each PE executes the same program at any time step...
Using basic AFSA to solve the multidimensional 0-1 knapsack problem can achieve good results when the data is small. However, when the data scale of the problem becomes larger and the dimension increases, it is difficult to meet the actual requirements in time. In this paper the idea of ...
The knapsack problem, maximize Σmi = 1 cixi when Σmi = 1 aixi⩽b for integers xi⩾0, can be solved by the classical step-off algorithm. The algorithm develops a series of feasible solutions with ever-increasing objective values. We make a change in the pro...
The knapsack problem, maximize Σmi = 1 cixi when Σmi = 1 aixi⩽b for integers xi⩾0, can be solved by the classical step-off algorithm. The algorithm develops a series of feasible solutions with ever-increasing objective values. We make a change in the problem so that the step-of...
Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem 0/1 knapsack problem belongs to combination optimization problem. Its optimal solution exists in the problem space including substantially large useless so... A Liu,J Wang,G Han,... - IEEE Computer Society 被引量: 39发表: ...