Non-deterministic algorithm for routing optimization: A case study

Don Jyh Fu Jeng*, Junzo Watada

*この研究の対応する著者

    研究成果: Conference contribution

    抄録

    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.

    本文言語English
    ホスト出版物のタイトルSecond International Conference on Innovative Computing, Information and Control, ICICIC 2007
    DOI
    出版ステータスPublished - 2008
    イベント2nd International Conference on Innovative Computing, Information and Control, ICICIC 2007 - Kumamoto
    継続期間: 2007 9 52007 9 7

    Other

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

    ASJC Scopus subject areas

    • コンピュータ サイエンス(全般)
    • 機械工学

    フィンガープリント

    「Non-deterministic algorithm for routing optimization: A case study」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル