A new DNA encoding method for traveling salesman problem

Authors:
Aili Han;Daming Zhu
Affiliations:
,Department of Computer Science and Technology, Shandong University, Weihai, China;School of Computer Science and Technology, Shandong University, Jinan, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Year:
2006

Citing 2
Cited 1

Molecular computation of solutions to combinatorial problems

Science
Integer programming models for computational biology problems

Journal of Computer Science and Technology - Special issue on bioinformatics

DNA solution based on sequence alignment to the Minimum Spanning Tree problem

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.