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

    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