Evolutionary search of binary orthogonal arrays

Luca Mariot, Stjepan Picek, Domagoj Jakobovic, Alberto Leporati

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

5 Citations (Scopus)


Orthogonal Arrays (OA) represent an interesting breed of combinatorial designs that finds applications in several domains such as statistics, coding theory, and cryptography. In this work, we address the problem of constructing binary OA through evolutionary algorithms, an approach which received little attention in the combinatorial designs literature. We focus on the representation of a feasible solution, which we encode as a set of Boolean functions whose truth tables are used as the columns of a binary matrix, and on the design of an appropriate fitness function and variation operators for this problem. We finally present experimental results obtained with genetic algorithms (GA) and genetic programming (GP) on optimizing such fitness function, and compare the performances of these two metaheuristics with respect to the size of the considered problem instances. The experimental results show that GP outperforms GA at handling this type of problem, as it converges to an optimal solution in all considered problem instances but one.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature – PPSN XV - 15th International Conference, 2018, Proceedings
EditorsA. Auger, C.M. Fonseca, N. Lourenço, P. Machado, L. Paquete, D. Whitley
Place of PublicationCham
Number of pages13
ISBN (Electronic)978-3-319-99253-2
ISBN (Print)978-3-319-99252-5
Publication statusPublished - 2018
Event15th International Conference on Parallel Problem Solving from Nature, PPSN 2018 - Coimbra, Portugal
Duration: 8 Sep 201812 Sep 2018
Conference number: 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on Parallel Problem Solving from Nature, PPSN 2018


  • Boolean functions
  • Genetic algorithms
  • Genetic programming
  • Orthogonal arrays

Fingerprint Dive into the research topics of 'Evolutionary search of binary orthogonal arrays'. Together they form a unique fingerprint.

Cite this