Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem

Authors:
Jerzy Greblicki;Jerzy Kotowski
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372
Venue:
Computer Aided Systems Theory - EUROCAST 2009
Year:
2009

Citing 0
Cited 4

A multi-objective binary harmony search algorithm

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
Cloud computing in educational applications methods of virtual desktops deployment

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
The cutting stock problem recent application in information technology

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
An improved adaptive binary Harmony Search algorithm

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.