Advertisement
Published in:
2009 | OriginalPaper | Chapter
Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem
Authors : Jerzy Greblicki, Jerzy Kotowski
Published in: Computer Aided Systems Theory - EUROCAST 2009
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In the paper we carried out the analysis of the properties of the Harmony Search Algorithm (
HSA
) on a well known one-dimensional binary knapsack problem. Binary knapsack problems are among the most widely studied problems in discrete optimization. Since the optimization versions of these problems are nP-hard, practical solution techniques do not ask for optimality, but are heuristics that generate feasible, suboptimal solutions. In this paper we describe the 0-1 knapsack problem itself, the backgrounds of the
HSA
, Baldwin and Lamarck Effects and the numerical tests. The result of the tests performed is surprised a bit.