Title :
Traveling Salesman Problem Based on DNA Computing
Author_Institution :
Weifang Univ., Weifang
Abstract :
Molecular programming is applied to traveling salesman problem whose solution requires encoding of real values in DNA strands. This paper introduces a new DNA encoding method to represent numerical values. DNA strands are designed to encode real values by variation of their temperatures. According to the characteristics of the problem, a DNA algorithm solving the traveling salesman problem is given. The effectiveness of the proposed method is verified by simulation.
Keywords :
biology computing; travelling salesman problems; DNA computing; DNA encoding method; molecular programming; traveling salesman problem; Biology computing; Bonding; Computational modeling; DNA computing; Educational institutions; Encoding; Polymers; Sequences; Temperature; Traveling salesman problems;
Conference_Titel :
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location :
Haikou
Print_ISBN :
978-0-7695-2875-5
DOI :
10.1109/ICNC.2007.784
