Paper Info
Title
Using genetic algorithms to generate Steiner triple systems
Abstract
Steiner systems, particularly triple systems, are usually generated by mathematicians using techniques from the theory of groups and quasi-groups. When pencil-and-paper enumeration becomes infeasible, mathematicians have used computers to carry out exhaustive searches. This paper presents some results of using genetic algorithms, which do not use exhaustive search, to generate Steiner systems. A specialized mutation operator was effective in generating Steiner triple systems. Future research will focus on improving the genetic algorithm to generate higher order Steiner systems whose existence is not currently known.
Year
DOI
Venue
1993
10.1145/170791.170872
ACM Conference on Computer Science
Keywords
Field
DocType
steiner triple system,triple system,exhaustive search,pencil-and-paper enumeration,genetic algorithm,steiner system,specialized mutation operator,higher order steiner system,higher order
Steiner systems,Monad (category theory),Brute-force search,Steiner tree problem,Computer science,Enumeration,Algorithm,Theoretical computer science,Genetic algorithm,Mutation operator
Conference
ISBN
Citations 
PageRank 
0-89791-558-5
1
0.40
References 
Authors
4
2
Name
Order
Citations
PageRank
Stephen J. Hartley1369.51
Aaron H. Konstam294.56