Abstract
We investigate the design of Orthogonal Latin Squares (OLS) by means of Genetic Algorithms (GA) and Genetic Programming (GP). Since we focus on Latin squares generated by Cellular Automata (CA), the problem can be reduced to the search of pairs of Boolean functions that give rise to OLS when used as CA local rules. As it is already known how to design CA-based OLS with linear Boolean functions, we adopt the evolutionary approach to address the nonlinear case, experimenting with different encodings for the candidate solutions. In particular, for GA we consider single bitstring, double bitstring and quaternary string encodings, while for GP we adopt a double tree representation. We test the two metaheuristics on the spaces of local rules pairs with n = 7 and n = 8 variables, using two fitness functions. The results show that GP is always able to generate OLS, even if the optimal solutions found with the first fitness function are mostly linear. On the other hand, GA achieves a remarkably lower success rate than GP in evolving OLS, but the corresponding Boolean functions are always nonlinear.
Original language | English |
---|---|
Title of host publication | GECCO'17 Proceedings of the Genetic and Evolutionary Computation Conference |
Place of Publication | New York, NY |
Publisher | Association for Computing Machinery (ACM) |
Pages | 306-313 |
Number of pages | 8 |
ISBN (Electronic) | 978-1-4503-4920-8 |
DOIs | |
Publication status | Published - 2017 |
Event | GECCO 2017: Genetic and Evolutionary Computation Conference - Berlin, Germany Duration: 15 Jul 2017 → 19 Jul 2017 http://gecco-2017.sigevo.org/index.html/HomePage |
Conference
Conference | GECCO 2017 |
---|---|
Country/Territory | Germany |
City | Berlin |
Period | 15/07/17 → 19/07/17 |
Other | A Recombination of the 26th International Conference on Genetic Algorithms (ICGA) and the 22nd Annual Genetic Programming Conference (GP). |
Internet address |
Keywords
- Orthogonal Latin Squares
- Cellular Automata
- Genetic Algorithms
- Genetic Programming
- Boolean Functions
- Pairwise Balancedness
- aternary Strings
- Nonlinearity