Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

筑波大学計算科学研究センター 平成28年度 年次報告書

まえがき　……　21 センター組織と構成員　……　32 平成 28 年度の活動状況　……　73 各研究部門の報告　……　10I. 素粒子物理研究部門　……　10II. 宇宙物理研究部門　……　36III. 原子核物理研究部門　……　64IV. 量子物性研究部門　……　88V. 生命科学研究部門　……　106 V-1. 生命機能情報分野　……　106 V-2. 分子進化分野　……　122VI. 地球環境研究部門　……　140VII. 高性能計算システム研究部門　……　154VIII. 計算情報学研究部門　……　205 Ⅷ-1. データ基盤分野　……　205 Ⅷ-2. 計算メディア分野　……　22