{"title":"Floyd Warshall算法在确定UD Nadira Cinta Rasa面包配送至龙目岛中部Praya的最短路线中的应用","authors":"Annisa Zaen Febryantika, Fidyatnisa Alyunda Puspandini, Indah Rizqiana Amalia, Maya Annisa","doi":"10.29303/emj.v4i1.96","DOIUrl":null,"url":null,"abstract":"Optimizing the shortest route is needed by a company in the process of distributing goods to consumers. This optimization can help companies optimize the mileage and costs from source to destination. In this study, the shortest route method used is the Floyd-Warshall algorithm to determine the shortest route. Floyd-Warshall algorithm can compare all the possible paths in the graph for each side of all vertices it passes with the minimum number. Based on the calculation results of this study, the shortest route was obtained from Mataram as the source and Praya as the destination was 31 km.","PeriodicalId":281429,"journal":{"name":"EIGEN MATHEMATICS JOURNAL","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of the Floyd Warshall Algorithm in Determining the Shortest Route for Distribution of UD Nadira Cinta Rasa Bread to Praya, Central Lombok\",\"authors\":\"Annisa Zaen Febryantika, Fidyatnisa Alyunda Puspandini, Indah Rizqiana Amalia, Maya Annisa\",\"doi\":\"10.29303/emj.v4i1.96\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimizing the shortest route is needed by a company in the process of distributing goods to consumers. This optimization can help companies optimize the mileage and costs from source to destination. In this study, the shortest route method used is the Floyd-Warshall algorithm to determine the shortest route. Floyd-Warshall algorithm can compare all the possible paths in the graph for each side of all vertices it passes with the minimum number. Based on the calculation results of this study, the shortest route was obtained from Mataram as the source and Praya as the destination was 31 km.\",\"PeriodicalId\":281429,\"journal\":{\"name\":\"EIGEN MATHEMATICS JOURNAL\",\"volume\":\"118 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EIGEN MATHEMATICS JOURNAL\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29303/emj.v4i1.96\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EIGEN MATHEMATICS JOURNAL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29303/emj.v4i1.96","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of the Floyd Warshall Algorithm in Determining the Shortest Route for Distribution of UD Nadira Cinta Rasa Bread to Praya, Central Lombok
Optimizing the shortest route is needed by a company in the process of distributing goods to consumers. This optimization can help companies optimize the mileage and costs from source to destination. In this study, the shortest route method used is the Floyd-Warshall algorithm to determine the shortest route. Floyd-Warshall algorithm can compare all the possible paths in the graph for each side of all vertices it passes with the minimum number. Based on the calculation results of this study, the shortest route was obtained from Mataram as the source and Praya as the destination was 31 km.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
