DNA-based evolutionary algorithm for cable trench problem

Authors:
Don Jyh-Fu Jeng;Ikno Kim;Junzo Watada
Affiliations:
Graduate School of Information, Production and Systems, Waseda University, Wakamatsu, Kitakyushu, Fukuoka, Japan;Graduate School of Information, Production and Systems, Waseda University, Wakamatsu, Kitakyushu, Fukuoka, Japan;Graduate School of Information, Production and Systems, Waseda University, Wakamatsu, Kitakyushu, Fukuoka, Japan
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Year:
2006

Citing 5
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The cable trench problem: combining the shortest path and minimum spanning tree problems

Computers and Operations Research
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Dna computation: Theory, practice, and prospects

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.