Non-deterministic algorithm for routing optimization

A case study

Don Jyh Fu Jeng, Junzo Watada

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish
    Title of host publicationSecond International Conference on Innovative Computing, Information and Control, ICICIC 2007
    DOIs
    Publication statusPublished - 2008
    Event2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007 - Kumamoto
    Duration: 2007 Sep 52007 Sep 7

    Other

    Other2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007
    CityKumamoto
    Period07/9/507/9/7

    Fingerprint

    DNA
    Cables
    Melting point
    Thermodynamic properties
    Silicon

    ASJC Scopus subject areas

    • Computer Science(all)
    • Mechanical Engineering

    Cite this

    Jeng, D. J. F., & Watada, J. (2008). Non-deterministic algorithm for routing optimization: A case study. In Second International Conference on Innovative Computing, Information and Control, ICICIC 2007 [4428065] https://doi.org/10.1109/ICICIC.2007.408

    Non-deterministic algorithm for routing optimization : A case study. / Jeng, Don Jyh Fu; Watada, Junzo.

    Second International Conference on Innovative Computing, Information and Control, ICICIC 2007. 2008. 4428065.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Jeng, DJF & Watada, J 2008, Non-deterministic algorithm for routing optimization: A case study. in Second International Conference on Innovative Computing, Information and Control, ICICIC 2007., 4428065, 2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007, Kumamoto, 07/9/5. https://doi.org/10.1109/ICICIC.2007.408
    Jeng DJF, Watada J. Non-deterministic algorithm for routing optimization: A case study. In Second International Conference on Innovative Computing, Information and Control, ICICIC 2007. 2008. 4428065 https://doi.org/10.1109/ICICIC.2007.408
    Jeng, Don Jyh Fu ; Watada, Junzo. / Non-deterministic algorithm for routing optimization : A case study. Second International Conference on Innovative Computing, Information and Control, ICICIC 2007. 2008.
    @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",

    }

    TY - GEN

    T1 - Non-deterministic algorithm for routing optimization

    T2 - A case study

    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

    SN - 0769528821

    SN - 9780769528823

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

    ER -