Open AccessWeb-Based Geographic Information System (GIS) in Determining Shortest Path of MSME Medan City Using Bellman-Ford Algorithm
Author(s) -
Ayu Cahyany Arrumdany,
Putri Perdana Sari,
Paet Rahmadani,
Ahmadi Irhamsyah Lubis
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1255/1/012075
Subject(s) - shortest path problem , ignorance , computer science , mathematics , algorithm , data mining , theoretical computer science , graph , philosophy , epistemology
Micro, Small and Medium Enterprises (MSME) are one of the drivers of Indonesian economy but have problems in introducing their products to the public. In addition, public ignorance of MSME and their products is another problem experienced by MSME. Therefore, a system is needed that can become a forum for MSME to introduce their businesses and display complete information about the MSME business in Medan City, such as a geographical information system that contains a mapping of the shortest MSME routes, estimated distances and travel time to these MSME. This study uses Bellman-Ford algorithm and Euclidean Distance method to map the shortest route to MSME. Based on the testing, a system is obtained that allows administrators to input MSME data and allows users to search for information about a MSME and its address along with mapping the shortest route.