{"title":"MEDAN城市在线运输服务应用算法DIJKSTRA的应用程序","authors":"Abdul Alfattah Hidayah","doi":"10.31602/ajst.v7i1.5710","DOIUrl":null,"url":null,"abstract":"This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,","PeriodicalId":126329,"journal":{"name":"AL ULUM JURNAL SAINS DAN TEKNOLOGI","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN\",\"authors\":\"Abdul Alfattah Hidayah\",\"doi\":\"10.31602/ajst.v7i1.5710\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,\",\"PeriodicalId\":126329,\"journal\":{\"name\":\"AL ULUM JURNAL SAINS DAN TEKNOLOGI\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AL ULUM JURNAL SAINS DAN TEKNOLOGI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31602/ajst.v7i1.5710\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AL ULUM JURNAL SAINS DAN TEKNOLOGI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31602/ajst.v7i1.5710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN
This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
