PERANCANGAN SISTEM PENUNJANG KEPUTUSAN PENCARIAN JARAK TERPENDEK MENUJU RUMAH SAKIT DAN PUSKESMAS DENGAN METODE DIJKSTRA

Abstract

Advances in technology and information offer various conveniences and alternatives in every activity and community activity. There are various types of activities and community activities that do not escape the role of technology and information. Of course, this makes it easier for the community to make decisions in every activity and activity. In fact, in determining the fastest route, people are faced with a choice of available routes and are required to make the right decision regarding the alternative shortest route. One of them is in determining the route/path to hospitals and health centers. To take the shortest route/path, you can use public transportation, such as buses, which are often the people's choice compared to other modes of transportation. The existence of hospitals and health centers is very important because they can help treat people who are sick and provide 24-hour Emergency Unit (ER) services. In particular, immigrants who still don't know where the hospitals and health centers are and have to take which route is closer to where they are. Dijkstra's method is very effectively used to map alternative paths, if the main route experiences obstacles. In addition, it can be used to solve the problem of the shortest route/path and maximum flow, the elements (weights) of the route are the distance traveled and the cost. Dijkstra's method does not solve the problem of negative lines and only looks for the minimum value from one node to another that is related to each other. In its implementation, the Dijkstra method can use dynamic or changing data.