Review Article: Solving 0-1 knapsack problem by a novel global harmony search algorithm

Authors:
Dexuan Zou;Liqun Gao;Steven Li;Jianhua Wu
Affiliations:
School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;Division of Business University of South Australia GPO Box 2471, Adelaide, SA 5001, Australia;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China
Venue:
Applied Soft Computing
Year:
2011

Citing 1
Cited 12

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
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.