Finding Designs with Genetic Algorithms
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.
KeywordsGenetic Algorithm Mutation Operator Crossover Operator Tournament Selection Direct Decomposition
Unable to display preview. Download preview PDF.
- Lawrence Davis, Handbook of genetic algorithms. Van Nostrand Reinhold, New York, 1991.Google Scholar
- David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.Google Scholar
- 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–324Google Scholar
- John H Holland, Adaption in Natural and Artificial Systems. The MIT Press, Cambridge, MA, 1992.Google Scholar