An improved monkey algorithm for a 0-1 knapsack problem
Y Zhou, X Chen, G Zhou - Applied Soft Computing, 2016 - Elsevier
The 0-1 knapsack problem is a classic combinational optimization problem. However, many
exiting algorithms have low precision and easily fall into local optimal solutions to solve the …
exiting algorithms have low precision and easily fall into local optimal solutions to solve the …
A k-means binarization framework applied to multidimensional knapsack problem
The multidimensional knapsack problem (MKP) is one of the widely known integer
programming problems. The MKP has received significant attention from the operational …
programming problems. The MKP has received significant attention from the operational …
[HTML][HTML] A binary differential search algorithm for the 0–1 multidimensional knapsack problem
The multidimensional knapsack problem (MKP) is known to be NP-hard in operations
research and it has a wide range of applications in engineering and management. In this …
research and it has a wide range of applications in engineering and management. In this …
A method to determine generalized basic probability assignment in the open world
W Jiang, J Zhan, D Zhou, X Li - Mathematical Problems in …, 2016 - Wiley Online Library
Dempster‐Shafer evidence theory (D‐S theory) has been widely used in many information
fusion systems since it was proposed by Dempster and extended by Shafer. However, how …
fusion systems since it was proposed by Dempster and extended by Shafer. However, how …
Overview on binary optimization using swarm-inspired algorithms
Swarm Intelligence is applied to optimisation problems due to its robustness, scalability,
generality, and flexibility. Based on simple rules, simple reactive agents-swarm (eg fish, bird …
generality, and flexibility. Based on simple rules, simple reactive agents-swarm (eg fish, bird …
Simplified binary cat swarm optimization
Inspired by the biological behavior of domestic cats, the Cat Swarm Optimization (CSO) is a
metaheuristic which has been successfully applied to solve several optimization problems …
metaheuristic which has been successfully applied to solve several optimization problems …
Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
H Wu, Y Zhou, Q Luo - International Journal of Bio-Inspired …, 2018 - inderscienceonline.com
We propose a new binary version of hybrid symbiotic organisms search algorithm based on
harmony search with greedy strategy for solving 0-1 knapsack problems. A greedy strategy …
harmony search with greedy strategy for solving 0-1 knapsack problems. A greedy strategy …
Solving 0–1 knapsack problems by binary dragonfly algorithm
M Abdel-Basset, Q Luo, F Miao, Y Zhou - … 2017, Liverpool, UK, August 7-10 …, 2017 - Springer
Abstract The 0–1 knapsack problem (0–1KP) is a well-known combinatorial optimization
problem. It is an NP-hard problem which plays significant roles in many real life applications …
problem. It is an NP-hard problem which plays significant roles in many real life applications …
Parameter identification of BIPT system using chaotic-enhanced fruit fly optimization algorithm
Bidirectional inductive power transfer (BIPT) system facilitates contactless power transfer
between two sides and across an air-gap, through weak magnetic coupling. Typically, this …
between two sides and across an air-gap, through weak magnetic coupling. Typically, this …
[PDF][PDF] Grey wolf optimization applied to the 0/1 knapsack problem
E Yassien, R Masadeh, A Alzaqebah… - International Journal of …, 2017 - researchgate.net
The knapsack problem (01KP) in networks is investigated in this paper. A novel algorithm is
proposed in order to find the best solution that maximizes the total carried value without …
proposed in order to find the best solution that maximizes the total carried value without …