A Modified DNA-Computing Algorithm To Solve TSP

Author

Mehdizadeh, K. ; Nekoui, Mohammad Ali ; Sabahi, K. ; Akbarimajd, A.

Author_Institution

K.N. Toosi Univ. of Technol., Tehran

fYear

2006

fDate

3-5 July 2006

Firstpage

65

Lastpage

68

Abstract

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

Keywords

biocomputing; mathematics computing; minimisation; travelling salesman problems; DNA computing; biocomputing; optimization problem; traveler salesman problem; traveling cost minimization; Cities and towns; Computer bugs; Concurrent computing; Costs; DNA computing; Dynamic programming; Jacobian matrices; Optimization methods; Organic materials; Organisms; DNA commands; DNA computing; TSP problem; optimization; parallel computation;

fLanguage

English

Publisher

ieee

Conference_Titel

Mechatronics, 2006 IEEE International Conference on

Conference_Location

Budapest

Print_ISBN

0-7803-9712-6

Electronic_ISBN

0-7803-9713-4

Type

conf

DOI

10.1109/ICMECH.2006.252498

Filename

4018333