A New DNA Encoding Method for Traveling Salesman Problem

We have devised a new DNA encoding method to represent weight and apply it to solve the traveling salesman problem, an instance of optimization problems on weighted graphs. For any weighted graphG=(V,E), vi∈V, 1≤i≤n, where exists weight wij on edgevivj, we use two DNA strands with different lengths to encode each of the edges. The longerDNA strand consists of three parts: one for the departure vertex, another for the weight, and the last for the arrival vertex. The shorter DNA strand is the reverse complementation of the center part of the longer one. The proposed weight encoding method is an improvement on the previous weight encoding methods, and it can more easily find the optimal solutions than the former ones. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on decision problems.

[1]  G Rozenberg,et al.  Computing with DNA by operating on plasmids. , 2000, Bio Systems.

[2]  Li Zhiyong,et al.  DNA Computation for a Category of Special Integer Planning Problem , 2005 .

[3]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[4]  Yang Zhi-min.  Complexity Analysis for the HEWN Algorithm-A Discussible Opinion , 2002 .

[5]  Wang Lei,et al.  A Surface-Based DNA Algorithm for the Perfect Matching Problem , 2005 .

[6]  Marzuki Khalid,et al.  DNA implementation of k-shortest paths computation , 2005, 2005 IEEE Congress on Evolutionary Computation.

[7]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[8]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems with DNA molecules encoding numerical values. , 2004, Bio Systems.

[9]  Xiaopeng Wei,et al.  Sticker DNA computer model —Part I: Theory , 2004 .

[10]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[11]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[12]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[13]  Shi V. Liu.  Debating controversies can enhance creativity , 2000, Nature.

[14]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[15]  Han Ai-li.  A study on the solution of 9-room diagram by state space method , 2004 .

[16]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[17]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.

[18]  Giuseppe Lancia,et al.  Integer programming models for computational biology problems , 2008, Journal of Computer Science and Technology.

[19]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems using molecular programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).