Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem
verfasst von : Jerzy Greblicki, Jerzy Kotowski
Erschienen in: Computer Aided Systems Theory - EUROCAST 2009
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.