Solving GA-hard problems with EMMRS and GPGPUs

Different techniques have been proposed to tackle GA-Hard problems. Some techniques work with different encodings and representations, other use reordering operators and several, such as the Evolutionary Mapping Method (EMM), apply genotype-phenotype mappings. EMM uses multiple chromosomes in a single cell for mating with another cell within a single population. Although EMM gave good results, it fails on solving some deceptive problems. In this line, EMMRS (EMM with Replacement and Shift) adds a new operator, consisting on doing a replacement and a shift of some of the bits within the chromosome. Results showed the efficiency of the proposal on deceptive problems. However, EMMRS was not tested with other kind of hard problems. In this paper we have adapted EMMRS for solving the Traveling Salesman Problem (TSP). The encodings and genetic operators for solving the TSP are quite different to those applied on deceptive problems. In addition, execution times recommended the parallelization of the GA. We implemented a GPU parallel version. We present here some preliminary results proving that Evolutionary Mapping Method with Replacement and Shift gives good results not only in terms of quality but also in terms of speedup on its GPU parallel version for some instances of the TSP problem.

[1]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[2]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[3]  Rick Chow,et al.  Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm , 2004, GECCO.

[4]  Dipankar Dasgupta,et al.  Handling deceptive problems using a different genetic search , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  M. Shackleton,et al.  An investigation of redundant genotype-phenotype mappings and their role in evolutionary search , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  Marc Toussaint,et al.  On Classes of Functions for which No Free Lunch Results Hold , 2001, Inf. Process. Lett..

[7]  José Ignacio Hidalgo,et al.  Solving discrete deceptive problems with EMMRS , 2008, GECCO '08.

[8]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[9]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[10]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[11]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[12]  Franz Rothlauf,et al.  Network Random KeysA Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2002, Evolutionary Computation.

[13]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[14]  D. E. Goldberg,et al.  An analysis of a reordering operator on a GA-hard problem , 1990, Biological Cybernetics.

[15]  Gunar E. Liepins,et al.  Deceptiveness and Genetic Algorithm Dynamics , 1990, FOGA.

[16]  William B. Langdon,et al.  Graphics processing units and genetic programming: an overview , 2011, Soft Comput..