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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arabas, J.: Lectures on Evolutionary Algorithms. WNT, Warsaw (2001) (in Polish)
Baldwin, J.M.: A new Factor in Evolution. American Naturalist 30, 441–451 (1896)
Cheng, Y.M., Lansivaara, L., Li, T., Chi, S.C., Sun, Y.J.: An improved harmony search minimization algorithm using different slip surface generation methods for slope stability analysis. Engineering Optimization 40, 95–115 (2008)
French, R.M., Messinger, A.: Genes, Phenes and the Baldwin Effect: Learning and Evolution in a Simulated Population, pp. 277–282. The MIT Press, Cambridge (1994)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)
GGeem, Z.W., Tseng, C.L.: New methodology, harmony search and its robustness. In: 2002 Genetic and Evolutionary Computation Conference, pp. 174–178 (2002)
Geem, Z.W.: Optimal cost design of water distribution networks using harmony search. In: Environmental Planning and Management Program, pp. 1–49. Johns Hopkins University (2005)
Greblicki, J., Kotowski, J.: Optimal RNS Moduli Set for DSP Applications. In: Proc. of MMAR 2005, 11th IEEE Conference on Methods and Models in Automation and Robotics (2005)
Greblicki, J., Kotowski, J.: The Greedy Solution of the OPTIMAL RNS Moduli Set Problem. In: Proc. of MMAR 2005, 11th IEEE Conference on Methods and Models in Automation and Robotics (2005)
Kotowski, J.: The use of the method of illusion to optimizing the simple cutting stock problem. In: Proc. MMAR 2001, 7th IEEE Conference on Methods and Models in Automation and Robotics, vol. 1, pp. 149–154 (2001)
Turney, P.: Myths and Legends of the Baldwin Effect. In: Proc. GECCO 1999, Genetic and Evolutionary Computation Conference (1999)
Weber, B.H., Depew, D.J.: Evolution and Learning: The Baldwin Effect Reconsidered. MIT Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greblicki, J., Kotowski, J. (2009). Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2009. EUROCAST 2009. Lecture Notes in Computer Science, vol 5717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04772-5_90
Download citation
DOI: https://doi.org/10.1007/978-3-642-04772-5_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04771-8
Online ISBN: 978-3-642-04772-5
eBook Packages: Computer ScienceComputer Science (R0)