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.
Math and Computer Science Department, Drexel University, Philadelphia, PA;
Department of Computer Science, Trinity University, San Antonio, TX;
机译:Steiner三重系统的准嵌入,或具有最大交集的不同阶数的Steiner三重系统的准嵌入
机译:Skolem序列生成的循环Steiner三重系统的不可定向双嵌入
机译:多层Steiner三元系统的构造和路由算法
机译:一种遗传算法,用于产生带有线尺寸和缓冲插入的施蒂纳树
机译:与施泰克三重系统独立套装算法探索
机译:通过遗传算法生成人工混响用于实时应用
机译:用遗传算法生成steiner三重系统