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

Full description

Saved in:
Bibliographic Details
Published in:ICICIC 2007 : second International Conference on Innovative Computing, Information and Control : 5-7 September 2007 p. 423
Main Authors: Don Jyh-Fu Jeng, Watada, J.
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.09.2007
Subjects:
Cost function
DNA computing
Gradient methods
Polynomials
Production systems
Routing
Shortest path problem
Temperature
Thermodynamics
Tree graphs
ISBN:0769528821, 9780769528823
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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 Watada, J.
Don Jyh-Fu Jeng
Author_xml – sequence: 1
  surname: Don Jyh-Fu Jeng
  fullname: Don Jyh-Fu Jeng
  organization: Production & Syst. Waseda Univ., Fukuoka
– sequence: 2
  givenname: J.
  surname: Watada
  fullname: Watada, J.
  organization: Production & Syst. Waseda Univ., Fukuoka
BookMark eNotjr1OwzAURi0BErR0ZmDxCyRc23Fis4WI0kpVK_EzV3bslIsau0rcoTw9RaBvOMORjr4JuQwxeELuGOSMgX5YNr_LOUCVF6AuyASqUkuuFGfXZDaOXwDAdKkZUzfkaR1D5nzyQ48Bx4Qtrfe7OGD67GkXB_oajwnDjm4OCXv8NgljeKQ1bczo6Vs6utMtuerMfvSzf07Jx_z5vVlkq83LsqlXGTIlU8aFbXnbGmF1J1ouulKDBcFdYc--M0KdXxZQee7ASqmNsb5UrgIvjaycFVNy_9dF7_32MGBvhtO2KLiCUoofCGtJ7Q
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICICIC.2007.408
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 423
ExternalDocumentID 4428065
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i185t-23bc2cca3b9f3c23f690b032d4b185fa38695407e2d0b559aabe68d70e5a57db3
IEDL.DBID RIE
ISBN 0769528821
9780769528823
IngestDate Wed Aug 27 01:34:53 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i185t-23bc2cca3b9f3c23f690b032d4b185fa38695407e2d0b559aabe68d70e5a57db3
PageCount 1
ParticipantIDs ieee_primary_4428065
PublicationCentury 2000
PublicationDate 2007-09-01
PublicationDateYYYYMMDD 2007-09-01
PublicationDate_xml – month: 09
  year: 2007
  text: 2007-09-01
  day: 01
PublicationDecade 2000
PublicationTitle ICICIC 2007 : second International Conference on Innovative Computing, Information and Control : 5-7 September 2007
PublicationTitleAbbrev ICICIC
PublicationYear 2007
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001969118
Score 1.3846862
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 423
SubjectTerms Cost function
DNA computing
Gradient methods
Polynomials
Production systems
Routing
Shortest path problem
Temperature
Thermodynamics
Tree graphs
Title Non-deterministic Algorithm for Routing Optimization: A Case Study
URI https://ieeexplore.ieee.org/document/4428065
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaioGpQIv4lgdGQlPbiWO2UlGBhEoHkLpV_gpUogkqKRL_nrPjtgwsKEtiJ1F0lnN-53fvELrsp0YlgrFI5hwACmVppEjMI6J1JgGQyFT7kX7k43E2nYpJA11tcmGstZ58Zq_dqd_LN6VeuVBZjzG_D9hETc7TOldrG08RKczbrEbmIiGwcuwHgZ31NQ3SPv1Y9B6G7qglDJmrLfmrtop3LaP2_z5qD3W3OXp4svE--6hhiwPUXhdpwGHOdtDtuCwiE0gvXpUZD95fy-W8eltgWLFixwmCN-An-HksQlbmDR7gIfg37GiG3130Mrp7Ht5HoXBCNAf3W0WEKg3GllSJnGpCc4DAKqbEMAX9uaQZWASQnCUmVgAppFQ2zQyPbSITbhQ9RK2iLOyRYz7lmsvEGCpzlsCzeSwo3KqoFlRSfow6ziSzj1obYxascfJ38ynarWOjjqN1hlrVcmXP0Y7-quafyws_oD_top24
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8QTfSECsZve_DoZKzdR70hkUDEyQETbqRf0yWyGRwm_ve-bgU8eDG7bO22LK_pXn-vv_d-CF13AiV8RqnDkxAACqGBIzw3dDwpIw6AhAeyHOlRGMfRdMrGNXSzzoXRWpfkM31rTsu9fJXLpQmVtSkt9wG30LZRzrLZWpuICgtg5kYVNme-B2vHji2xs7omtrhPx2XtYc8cVRFDatQlf6mrlM6l3_jfZ-2j1iZLD4_X_ucA1XR2iBormQZsZ20T3cd55ihLeynrMuPu-2u-SIu3OYY1KzasIHgDfobfx9zmZd7hLu6Bh8OGaPjdQi_9h0lv4FjpBCcFB1w4HhESzM2JYAmRHkkABAuXeIoK6E84icAigOW0p1wBoIJzoYNIha72uR8qQY5QPcszfWy4T4kMua8U4Qn14dnEZQRuFUQywkl4gprGJLOPqjrGzFrj9O_mK7Q7mDyNZqNh_HiG9qpIqWFsnaN6sVjqC7Qjv4r0c3FZDu4PWKGhAQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=ICICIC+2007+%3A+second+International+Conference+on+Innovative+Computing%2C+Information+and+Control+%3A+5-7+September+2007&rft.atitle=Non-deterministic+Algorithm+for+Routing+Optimization%3A+A+Case+Study&rft.au=Don+Jyh-Fu+Jeng&rft.au=Watada%2C+J.&rft.date=2007-09-01&rft.pub=IEEE&rft.isbn=9780769528823&rft.spage=423&rft.epage=423&rft_id=info:doi/10.1109%2FICICIC.2007.408&rft.externalDocID=4428065
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769528823/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769528823/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769528823/sc.gif&client=summon&freeimage=true