Sorting Networks Design Using Coevolutionary CGP

Abstract

This paper deals with sorting networks design using Cartesian Genetic Programming and coevolution. Sorting networks are abstract models capable of sorting lists of numbers. Advantage of sorting networks is that they are easily implemented in hardware, but their design is very complex. One of the unconventional and effective ways to design sorting networks is Cartesian Genetic Programming (CGP). CGP is one of evolutionary algorithms that are inspired by Darwinian theory of evolution. Efficiency of the CGP algorithm can be increased by using coevolution. Coevolution is an approach that works with multiple populations, which are influencing one another and  constantly evolving, thus prevent the local optima deadlock. In this work it is shown, that with the use of coevolution, it is possible to achieve nearly twice the acceleration compared to evolutionary design