In the paper we carried out the analysis of the properties of the Harmony Search Algorithm (
) 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
, Baldwin and Lamarck Effects and the numerical tests. The result of the tests performed is surprised a bit.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten