Non-deterministic Algorithm for Routing Optimization: A Case Study

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 solv...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ICICIC 2007 : second International Conference on Innovative Computing, Information and Control : 5-7 September 2007 s. 423
Hlavní autoři: Don Jyh-Fu Jeng, Watada, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.09.2007
Témata:
Cost function
DNA computing
Gradient methods
Polynomials
Production systems
Routing
Shortest path problem
Temperature
Thermodynamics
Tree graphs
ISBN:0769528821, 9780769528823
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:0769528821
9780769528823
DOI:10.1109/ICICIC.2007.408