A Novel Solution for Simultaneously Finding the Shortest and Possible Paths in Complex Networks,ERICDATA高等教育知識庫
高等教育出版
熱門: 崔雪娟  王美玲  李明昆  王善边  黃昱倫  黃乃熒  
高等教育出版
首頁 臺灣期刊   學校系所   學協會   民間出版   大陸/海外期刊   政府機關   學校系所   學協會   民間出版   DOI註冊服務
閱讀全文
篇名
A Novel Solution for Simultaneously Finding the Shortest and Possible Paths in Complex Networks
並列篇名
A Novel Solution for Simultaneously Finding the Shortest and Possible Paths in Complex Networks
作者 Wai Mar HlaingShi-Jian LiuJeng-Shyang Pan
英文摘要
A Novel graph approach named Combined Forward and Backward Heuristic Search (CFBHS) is proposed in this paper, which can be used to solve optimization problems in areas such as transportation and network routing. There are two major aspects distinct our method from the most cited ones. Firstly, though focuses on getting the shortest path in a graph when both source and destination are given, this work can also find other possible paths as outputs. Secondly, the proposed algorithm is a high-performance one, which is achieved by (1) reducing unnecessary nodes and edges to reach a target optimum based on dynamically calculated heuristic values and (2) finding the results by using the subdivision scheme instead of computing over the whole graph. Experiments are carried out for the complex road network of Yangon Region. The comparisons show that our algorithm is about 100 times faster than the bidirectional Dijkstra’s algorithm. Besides, benefit from the heuristic forward and backward search, the proposed method can achieve very low time complexity, which is similar to the A*, but A* can only produce the shortest path. By contrast, the proposed algorithm is competent for finding not only the shortest but also many possible paths in complex road networks such as undirected graph and hypergraph networks.
起訖頁 1693-1707
關鍵詞 Shortest path algorithmBi-directional DijkstraHeuristic searchDistance based methods
刊名 網際網路技術學刊  
期數 201911 (20:6期)
出版單位 台灣學術網路管理委員會
DOI 10.3966/160792642019102006002   複製DOI
QR Code
該期刊
上一篇
Disjoint Multipath based Secure Routing in Opportunistic Networks
該期刊
下一篇
Interactive Teaching Aids Integrating Building Blocks and Programming Logic

高等教育知識庫  閱讀計畫  教育研究月刊  新書優惠  

教師服務
合作出版
期刊徵稿
聯絡高教
高教FB
讀者服務
圖書目錄
教育期刊
訂購服務
活動訊息
數位服務
高等教育知識庫
國際資料庫收錄
投審稿系統
DOI註冊
線上購買
高點網路書店 
元照網路書店
博客來網路書店
教育資源
教育網站
國際教育網站
關於高教
高教簡介
出版授權
合作單位
知識達 知識達 知識達 知識達 知識達 知識達
版權所有‧轉載必究 Copyright2011 高等教育文化事業股份有限公司  All Rights Reserved
服務信箱:edubook@edubook.com.tw 台北市館前路 26 號 6 樓 Tel:+886-2-23885899 Fax:+886-2-23892500