BulDML at Institute of Mathematics and Informatics >
International Journal ITA >
2008 >
Volume 15 Number 4 >

Please use this identifier to cite or link to this item:

Title: Solving Travelling Salesman Problem in a Simulation of Genetic Algorithms with DNA
Authors: Goni Moreno, Angel
Keywords: DNA Computing
Evolutionary Computing
Genetic Algorithms
Issue Date: 2008
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: In this paper it is explained how to solve a fully connected N-City travelling salesman problem (TSP) using a genetic algorithm. A crossover operator to use in the simulation of a genetic algorithm (GA) with DNA is presented. The aim of the paper is to follow the path of creating a new computational model based on DNA molecules and genetic operations. This paper solves the problem of exponentially size algorithms in DNA computing by using biological methods and techniques. After individual encoding and fitness evaluation, a protocol of the next step in a GA, crossover, is needed. This paper also shows how to make the GA faster via different populations of possible solutions.
ISSN: 1313-0463
Appears in Collections:Volume 15 Number 4

Files in This Item:

File Description SizeFormat
ijita15-4-p08.pdf132.98 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License