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...
A Tabu Search Algorithm for the Multidimensional Knapsack Problems多维背包问题的禁忌搜索求解 term memory is introduced to Tabu Search and a Tabu Search algorithm based on double tabu list for the multidimensional 0-1 knapsack problems is proposed... HE Yi,QIU YuHui,LIU GuangYuan,... - 《计算机...
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 ...
We proposed an efficient algorithm for solving RTVKP with dynamic size of knapsack based on dynamic programming method, and analyzed the complexity of new algorithm and the condition of its successful executing. I}he results of simulation computation show that the exact algorithm is an efficient ...
The 0-1 multidimensional knapsack problem (MKP) ar Abul,Kalam,Azad,... - 《Swarm & Evolutionary Computation》 被引量: 40发表: 2014年 A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems This paper proposes a simplified binary version of the artificial fish swa...
Given a set of n objects, the objective of the 0-1 multidimensional knapsack problem (MKP_01) is to find a subset of the object set that maximizes the total profit of the objects in the subset while satisfying m knapsack constraints. In this paper, we have proposed a new artificial bee...
KNAPSACK 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. The time complexity varies ...
29 proposed a binary SMA to solve the 0–1 knapsack problem; Zubaidi et al.30 combined SMA and artificial neural network (ANN) for urban water demand prediction; Chen and Liu31 combined K-means clustering and chaotic SMA with support vector regression to obtain higher prediction accuracy; ...
This piece picks up E-kKP as a knapsack problem in relation to the conventional and the simplest 2-approximation algorithm for the 0-1 knapsack problem. Taking account of the similarity between E-kKP and the multiple-choice knapsack problem, we mention how to produce two candidates onto the ...