Modified Harmony Search Algorithm for 0-1 Knapsack Problems

Hong Gang Xia; Qing Liang Wang

doi:10.4028/www.scientific.net/AMM.365-366.182

Paper Titles

Genetic Algorithms Study in Switch Electrical Appliances Electric Arc Feature Extraction
p.165

Opposition-Based Improved Harmony Search Algorithm Solve Unconstrained Optimization Problems
p.170

A New Variant Harmony Search Algorithm for Unconstrained Numerical Optimization Problems
p.174

Opposition-Based Modified Differential Evolution Algorithm for Power System Economic Load Dispatch
p.178

Modified Harmony Search Algorithm for 0-1 Knapsack Problems
p.182

Computational Modelling of Liquid Sloshing in Rectangular Tank
p.186

On Starting Population Selection for GSAT
p.190

Study on the Improvement of Genetic Algorithm by Using Vehicle Routing Problem
p.194

Finite Element Analysis of a Wind-Solar Hybrid Powered Street Light
p.201

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 365-366Modified Harmony Search Algorithm for 0-1 Knapsack...

Modified Harmony Search Algorithm for 0-1 Knapsack Problems

Abstract:

In this paper, a modified harmony search (MHS) algorithm was presented 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, and the key parameters PAR and BW dynamically adjusted with the number of generation. 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).

You might also be interested in these eBooks

Machine Design and Manufacturing Engineering II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 365-366)

Pages:

182-185

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.365-366.182

Citation:

Cite this paper

Online since:

August 2013

Authors:

Hong Gang Xia, Qing Liang Wang

Keywords:

0-1 Knapsack Problem, Modified Harmony Search, Position Update, Stability

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] G. Mavrotas, D. Diakoulaki, Athanasios Kourentzis, Selection among ranked projects under segmentation, policy and logical constraints, European Journal of Operational Research 187(2008)177–192.

DOI: 10.1016/j.ejor.2007.03.010

Google Scholar

[2] Fayard D, Plateau G. Resolution of the 0–1 knapsack problem comparison of methods [J], Mathematical Programming, 1975, 8(1): 272-307.

DOI: 10.1007/bf01580448

Google Scholar

[3] Geem Z W, Kim J H, Loganathan G V. A new heuristic optimization algorithm: harmony search. Simulation, 2001, 76(2): 60-68.

DOI: 10.1177/003754970107600201

Google Scholar

[4] M Mahdavi, M Fesanghary, E Damangir. An improve harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 2007; 188(2) 1567-1579.

DOI: 10.1016/j.amc.2006.11.033

Google Scholar

[5] Zou Dexuan，Gao Liqun，Li Steven，Wu Jianhua. Novel global harmony search algorithm for unconstrained problems [J], Neurocomputing, 2010, 73(16-18): 3308-3318.

DOI: 10.1016/j.neucom.2010.07.010

Google Scholar

[6] Zou Dexuan，Gao Liqun，Li Steven，Wu Jianhua. Solving 0-1 knapsack problem by a novel global harmony search algorithm, Applied Soft Computing. 2011, 11(2): 1556-1564.

DOI: 10.1016/j.asoc.2010.07.019

Google Scholar