Genetic Algorithms Fitness Function DNA Computing Evolutionary Computing
Institute of Information Theories and Applications FOI ITHEA
In this paper a computational mode is presented base on DNA molecules. This model incorporates the
theoretical simulation of the principal operations in genetic algorithms. It defines the way of coding of individuals,
crossing and the introduction of the individuals so created into the population. It resolves satisfactorily the
problems of fitness coding. It shows also the model projection for the resolution of TSP. This is the basic step that
will allow the resolution of larger examples of search problems beyond the scope of exact exponentially sized
DNA algorithms like the proposed by Adleman [Adleman, 1994] and Lipton [Lipton, 1995].
* This work has been partially supported by Spanish Project TIC2003-9319-c03-03 “Neural Networks and
Networks of Evolutionary Processors”.