Non-deterministic algorithm for routing optimization: A case study

Don Jyh Fu Jeng; Junzo Watada

doi:10.1109/ICICIC.2007.408

Non-deterministic algorithm for routing optimization: A case study

Don Jyh Fu Jeng^*, Junzo Watada

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

A routing optimization problem is solved by a non-deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solved by a conventional computing method. DNA computing is applied to overcome the limitation of a silicon-based computer. The numerical values are represented by the fixed-length DNA strands, and the weights are varied by the melting temperatures. Biochemical techniques with DNA thermodynamic properties are used for effective local search of the optimal solution.

Original language	English
Title of host publication	Second International Conference on Innovative Computing, Information and Control, ICICIC 2007
DOIs	https://doi.org/10.1109/ICICIC.2007.408
Publication status	Published - 2008
Event	2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007 - Kumamoto Duration: 2007 Sept 5 → 2007 Sept 7

Other

Other	2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007
City	Kumamoto
Period	07/9/5 → 07/9/7

ASJC Scopus subject areas

Computer Science(all)
Mechanical Engineering

Access to Document

10.1109/ICICIC.2007.408

Cite this

@inproceedings{2437d6e79aa04a9bb56ef2f5e8b27ac2,

title = "Non-deterministic algorithm for routing optimization: A case study",

abstract = "A routing optimization problem is solved by a non-deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solved by a conventional computing method. DNA computing is applied to overcome the limitation of a silicon-based computer. The numerical values are represented by the fixed-length DNA strands, and the weights are varied by the melting temperatures. Biochemical techniques with DNA thermodynamic properties are used for effective local search of the optimal solution.",

author = "Jeng, {Don Jyh Fu} and Junzo Watada",

year = "2008",

doi = "10.1109/ICICIC.2007.408",

language = "English",

isbn = "0769528821",

booktitle = "Second International Conference on Innovative Computing, Information and Control, ICICIC 2007",

note = "2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007 ; Conference date: 05-09-2007 Through 07-09-2007",

}

TY - GEN

T1 - Non-deterministic algorithm for routing optimization

T2 - 2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007

AU - Jeng, Don Jyh Fu

AU - Watada, Junzo

PY - 2008

Y1 - 2008

N2 - A routing optimization problem is solved by a non-deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solved by a conventional computing method. DNA computing is applied to overcome the limitation of a silicon-based computer. The numerical values are represented by the fixed-length DNA strands, and the weights are varied by the melting temperatures. Biochemical techniques with DNA thermodynamic properties are used for effective local search of the optimal solution.

AB - A routing optimization problem is solved by a non-deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solved by a conventional computing method. DNA computing is applied to overcome the limitation of a silicon-based computer. The numerical values are represented by the fixed-length DNA strands, and the weights are varied by the melting temperatures. Biochemical techniques with DNA thermodynamic properties are used for effective local search of the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=39049151286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39049151286&partnerID=8YFLogxK

U2 - 10.1109/ICICIC.2007.408

DO - 10.1109/ICICIC.2007.408

M3 - Conference contribution

AN - SCOPUS:39049151286

SN - 0769528821

SN - 9780769528823

BT - Second International Conference on Innovative Computing, Information and Control, ICICIC 2007

Y2 - 5 September 2007 through 7 September 2007

ER -

Non-deterministic algorithm for routing optimization: A case study

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this