Abstract
In this paper we use simulated evolution to solve three design theoretic problems, direct decomposition of a complete graph into smaller complete graphs, decomposition of a complete graph into smaller complete graphs with difference sets, and the seating of twelve people at three four person tables for multiple nights in an even handed fashion. The paper is intended as a tutorial for someone familiar with design theory but unfamiliar with genetic algorithms.
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
Lawrence Davis, Handbook of genetic algorithms. Van Nostrand Reinhold, New York, 1991.
David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
Stephanie Forrest, Genetic Algorithms: Principles of Natural Selection Applied to Computation, Science 261 (1993), 872–878.
W. Daniel Hillis, Co-Evolving Parasites Improve Simulated Evolution as an Optimization Procedure, in Artificial Life II (Santa Fe Institute Studies in the Sciences of Complexity 10 ), ed. Christopher Langton, Addison-Wesley, Reading, 1991, 313–324
John H Holland, Adaption in Natural and Artificial Systems. The MIT Press, Cambridge, MA, 1992.
G. F. Royle and W. D. Wallis, Constructing Bridge Club Designs, Bulletin of the Institute for Combinatorics and its Applications 11 (1994), 122–125.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ashlock, D. (1996). Finding Designs with Genetic Algorithms. In: Wallis, W.D. (eds) Computational and Constructive Design Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2497-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2497-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-2499-8
Online ISBN: 978-1-4757-2497-4
eBook Packages: Springer Book Archive