Support vector machine for the implementation of the fitness function of genetic algorithms

Abstract

A good number of search and optimization problems, computationally speaking, fall within the "intractable problems" and their complexity is of the exponential order. In this type of problem, genetic algorithms are an excellent alternative to find solutions close to the optimum. One of the phases of the genetic algorithms requires a fitness function, which will allow to select the individuals of the next generation. This aptitude function is generally implemented based on mathematical expressions or functions. However, some of the problems that can be solved with genetic algorithms present the difficulty of requiring subjective information to define the fitness function; above all, when the individual selection process requires an assessment conditioned by sensory aspects or experience. In these cases, defining the fitness function mathematically presents a lot of complexity or becomes unfeasible. The present work aims to find computer solutions to this type of problem, embedding the support vector machines in the implementation of the fitness functions of the genetic algorithms.