Solving 0-1 knapsack problem by a novel global harmony search algorithm
Date
2011
Authors
Zou, D.
Gao, L.
Li, S.
Wu, J.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Applied Soft Computing, 2011; 11(2):1556-1564
Statement of Responsibility
Conference Name
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2010 Elsevier