在Manado市七家酒店的情况下，确定通往Manado的Sam Ratulangi机场的最短路径的Dijkstra算法。

IF 1.3 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Distributed Computing Pub Date : 2021-01-07 DOI:10.35799/DC.9.2.2020.29146

Yohana Permata Hutapea, C. Montolalu, Hanny A. H. Komalig

{"title":"在Manado市七家酒店的情况下，确定通往Manado的Sam Ratulangi机场的最短路径的Dijkstra算法。","authors":"Yohana Permata Hutapea, C. Montolalu, Hanny A. H. Komalig","doi":"10.35799/DC.9.2.2020.29146","DOIUrl":null,"url":null,"abstract":"Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"158"},"PeriodicalIF":1.3000,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport.\",\"authors\":\"Yohana Permata Hutapea, C. Montolalu, Hanny A. H. Komalig\",\"doi\":\"10.35799/DC.9.2.2020.29146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.\",\"PeriodicalId\":50569,\"journal\":{\"name\":\"Distributed Computing\",\"volume\":\"9 1\",\"pages\":\"158\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2021-01-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Distributed Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.35799/DC.9.2.2020.29146\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.35799/DC.9.2.2020.29146","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 1

摘要

万鸦老市有许多著名的旅游景点，每年游客数量都在增加。游客需要设施齐全的酒店，如四星级酒店。游览完万鸦老后，游客们会回到他们来的地方。正在使用的运输方式之一是飞机。然后他们需要一条路径，而不是通常的路径;他们需要最短的路径去萨姆·拉图兰吉机场。在前人研究的基础上，利用图论对最短路径进行建模。酒店将被表示为顶点，从每个酒店到机场的路径将被表示为边。使用Dijkstra算法搜索最短路径，然后将看到与谷歌映射的最短路径的差异。基于分析结果，Dijkstra算法选择权值最小的最短路径。Dijkstra算法与谷歌地图的不同之处是，在确定从四星级酒店到机场的最短路径时，Dijkstra算法强调短途旅行距离，而谷歌地图更强调短途旅行时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport.

Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Distributed Computing 工程技术-计算机：理论方法

CiteScore

3.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.