DNA solution to the traveling salesman optimization problem

Abstract

In 1994,Leonard M. Adleman firstly used biological experiments with DNA stands to solve the directed Hamiltonian path problem,which is considered to be intractable because of its NP-completeness. In recent work, the use of DNA molecules to solve hard computational problems has been demonstrated.However, those DNA algorithms involved are meant to solve decision problems. In this paper, we propose new molecular solution to a main NP-hard optimization problem:the travelilng salesman optimizatioin.problem