Abstract
The performance of several algorithms for optimizing a combinatorical problem is compared empirically. The following topics are studied: • Can population based search strategies find good solutions faster than non-population ones?
-
• Are strategies that recombine two individuals to form new solutions better than those who use one individual only?
-
• Does the size of the population affect on the performance?
-
• Does the way how individuals are selected from the population affect on the performance?
The test problem used in these experiments is knapsack. 5000 variations of the test problem were solved. The number of the test function evaluations was recorded in the simulations. Statistical data was obtained in the form of cumulative frequencies and average values.
Based on these simulations the short answers to the four questions above are: yes; not necessarily; yes, but it depends on the selection strategy; and yes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Thomas Back and Frank Hoffmeister. Extended selection mechanisms in genetic algorithms. In Richard K. Belew and Lashon B. Booker, editors, Fourth International Conference on Genetic Algorithms, San Diego, July 1991.
David E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, 1989.
David E. Goldberg. Sizing populations for serial and parallel genetic algorithms. In J. David Schaffer, editor, Third International Conferenceon Genetic Algorithms, George Mason University, June 1989.
S. Kirkpatric, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220 (4598), 1983.
Vittorio Maniezzo. The rudes and the shrewds: an experimental comparison of several evolutionary heutistic applied to the qad problem. Technical Report 91-042, Politecnico di Milano, 1991.
Edward M. Reingold, Jurg Nievergelt, and Narsing Deo. Combinatorical Algorithms: Theory and Practice. Prentice-Hall, 1977.
William M. Spears and Kenneth A. De Jong. On the virtues of parameterized uniform crossover. In Richard K. Belew and Lashon B. Booker, editors, Fourth International Conference on Genetic Algorithms, San Diego, July 1991.
Darrel Whitley. The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J. David Schaffer, editor, Third International Conference on Genetic Algorithms, George Mason University, June 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag/Wien
About this paper
Cite this paper
Autere, A. (1993). An Empirical Study of Population and Non-population Based Search Strategies for Optimizing a Combinatorical Problem. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7533-0_55
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82459-7
Online ISBN: 978-3-7091-7533-0
eBook Packages: Springer Book Archive