抄録
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月 5 → 2007 9月 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
- コンピュータ サイエンス（全般）
- 機械工学