+ Site Statistics
+ Search Articles
+ PDF Full Text Service
How our service works
Request PDF Full Text
+ Follow Us
Follow on Facebook
Follow on Twitter
Follow on LinkedIn
+ Subscribe to Site Feeds
Most Shared
PDF Full Text
+ Translate
+ Recently Requested

Solving traveling salesman problems with DNA molecules encoding numerical values



Solving traveling salesman problems with DNA molecules encoding numerical values



Bio Systems 78(1-3): 39-47



We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving.

Please choose payment method:






(PDF emailed within 0-6 h: $19.90)

Accession: 012569020

Download citation: RISBibTeXText

PMID: 15555757

DOI: 10.1016/j.biosystems.2004.06.005


Related references

Limitations of neural networks for solving traveling salesman problems. IEEE Transactions on Neural Networks 6(1): 280-282, 1995

Solving large scale traveling salesman problems by chaotic neurodynamics. Neural Networks 15(2): 271-283, 2002

Learning to cooperate in solving the traveling salesman problem. International Journal of Neural Systems 15(1-2): 151-162, 2005

Multiagent optimization system for solving the traveling salesman problem (TSP). IEEE Transactions on Systems Man and Cybernetics. Part B Cybernetics 39(2): 489-502, 2009

An new self-organizing maps strategy for solving the traveling salesman problem. Chaos, Solitons & Fractals 28(4): 1082-1089, 2006

Solving the Traveling Salesman's Problem Using the African Buffalo Optimization. Computational Intelligence and Neuroscience 2016: 1510256, 2016

Traveling Salesman Approach for Solving Petrol Distribution Using Simulated Annealing. American Journal of Applied Sciences 5(11): 1543-1546, 2008

A columnar competitive model for solving multi-traveling salesman problem. Chaos, Solitons & Fractals 31(4): 1009-1019, 2007

Solving a four-destination traveling salesman problem using Escherichia coli cells as biocomputers. Acs Synthetic Biology 3(12): 972-975, 2014

A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151: 1227-1236, 2015

Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem. Sensors 19(8):, 2019

New Method of Solving the Traveling Salesman Problem Based on Real Space Renormalization Theory. Physical Review Letters 75(9): 1683-1686, 1995

An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem. Neurocomputing 71(7-9): 1359-1372, 2008

Stability of Solutions to Classes of Traveling Salesman Problems. IEEE Transactions on Cybernetics 46(4): 973-985, 2016

An evolutionary algorithm for large traveling salesman problems. IEEE Transactions on Systems Man and Cybernetics. Part B Cybernetics 34(4): 1718-1729, 2004