Abstract
An evolutionary DNA computing algorithm is proposed for solving a cable trench problem in this paper. The cable trench problem is a combination of the shortest path and minimum spanning tree problems, which makes it difficult to be solved by conventional computing method. DNA computing is applied to overcome the limitation, where fixed-length DNA strands are used in representing numerical values and the weights are varied by melting temperatures. Biochemical techniques in terms of DNA thermodynamic properties are used for effective local search of the optimal solution. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Jeng, D. J. F., Kim, I., & Watada, J. (2006). DNA-based evolutionary algorithm for cable trench problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4253 LNAI-III, pp. 922–929). Springer Verlag. https://doi.org/10.1007/11893011_117
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
