A Modified Harmony Search Algorithm for 0-1 Knapsack Problems

Author

Zhang, Ping ; Shan, Xiaoyou ; Gu, Wu

Author_Institution

Anshan Normal Univ., Anshan, China

fYear

2012

fDate

July 31 2012-Aug. 2 2012

Firstpage

85

Lastpage

88

Abstract

This paper presents a modified harmony search (MHS) algorithm for solving 0-1 knapsack problems. MHS employs position update strategy for generating new solution vectors that enhances accuracy and convergence rate of harmony search (HS) algorithm. Besides, the harmony memory consideration rate (HMCR) is dynamically adapted to the changing of objective function value in the current harmony memory. Based on the experiment of solving ten classic 0-1 knapsack problems, the MHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its two improved algorithms (IHS and NGHS).

Keywords

convergence; knapsack problems; search problems; 0-1 knapsack problems; HMCR; HS algorithm; MHS algorithm; convergence rate; current harmony memory; harmony memory consideration rate; modified harmony search algorithm; objective function value; Algorithm design and analysis; Heuristic algorithms; Linear programming; Mathematical model; Optimization; Search problems; Vectors; 0-1 knapsack problem; modified harmony search; position update; stability;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Manufacturing and Automation (ICDMA), 2012 Third International Conference on

Conference_Location

GuiLin

Print_ISBN

978-1-4673-2217-1

Type

conf

DOI

10.1109/ICDMA.2012.20

Filename

6298260