A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem
IACSIT-SC '09 Proceedings of the 2009 International Association of Computer Science and Information Technology - Spring Conference
A novel quantum inspired cuckoo search for knapsack problems
International Journal of Bio-Inspired Computation
An Intelligent Tuned Harmony Search algorithm for optimisation
Information Sciences: an International Journal
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm
International Journal of Bio-Inspired Computation
Information Sciences: an International Journal
An improved adaptive binary Harmony Search algorithm
Information Sciences: an International Journal
Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem
Applied Soft Computing
Optimal power flow solution using improved harmony search method
Applied Soft Computing
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
Journal of Computational and Applied Mathematics
Survey A survey on applications of the harmony search algorithm
Engineering Applications of Artificial Intelligence
Solving 0-1 knapsack problem by continuous ACO algorithm
International Journal of Computational Intelligence Studies
A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
Journal of Computational and Applied Mathematics
An entropy-based neighbor selection approach for collaborative filtering
Knowledge-Based Systems
Hi-index | 0.00 |
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0-1 knapsack problems. The proposed algorithm includes two important operations: position updating and genetic mutation with a small probability. The former enables the worst harmony of harmony memory to move to the global best harmony rapidly in each iteration, and the latter can effectively prevent the NGHS from trapping into the local optimum. Computational experiments with a set of large-scale instances show that the NGHS can be an efficient alternative for solving 0-1 knapsack problems.