Finding Designs with Genetic Algorithms

Daniel Ashlock ()
Additional contact information
Daniel Ashlock: Iowa State University, Mathematics Department

Chapter Chapter 4 in Computational and Constructive Design Theory, 1996, pp 49-65 from Springer

Abstract: 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.

Keywords: Genetic Algorithm; Mutation Operator; Crossover Operator; Tournament Selection; Direct Decomposition (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-2497-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9781475724974

DOI: 10.1007/978-1-4757-2497-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().