A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems
In order to better solve discrete 0-1 knapsack problems, a novel global-best harmony search algorithm with binary coding, called DGHS, is proposed.First, an initialization based on a greedy mechanism is employed to improve the initial solution quality in DGHS.Next, we present a novel improvisation process based on intuitive cognition of improvising