A Modified DNA-Computing Algorithm To Solve TSP

A Modified DNA-Computing Algorithm To Solve TSP

One of the problems that have been solved by DNA computing - as a kind of bio-computing techniques - is traveler salesman problem (TSP) which is a typical optimization problem. Previously proposed DNA computing methods for solving TSP suppose that all intercity costs are the same, so the minimizatio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mehdizadeh, K., Nekoui, M.A., Sabahi, K., Akbarimajd, A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Cities and towns
Computer bugs
Concurrent computing
Costs
DNA commands
DNA computing
Dynamic programming
Jacobian matrices
optimization
Optimization methods
Organic materials
Organisms
parallel computation
TSP problem
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:One of the problems that have been solved by DNA computing - as a kind of bio-computing techniques - is traveler salesman problem (TSP) which is a typical optimization problem. Previously proposed DNA computing methods for solving TSP suppose that all intercity costs are the same, so the minimization of the traveling cost has not been considered. On the other hand the earlier algorithms have some bugs that may fail in experimental environments. In this paper we have modified the previous algorithm to minimize the traveling cost in solving TSP. Also we have debugged the algorithms for an exact operation in experimental environments
DOI:10.1109/ICMECH.2006.252498