Resolving the shortest path problem using the haversine algorithm
Dwi Arman Prasetya, Phong Thanh Nguyen, Rinat Faizullin, Iswanto Iswanto, Edmond Febrinicko Armay
Abstract
Route search requires a useful and accurate algorithm to calculate the distance between two objects, especially on a round surface such as the earth. This algorithm provides a considerable circle distance between two locations on a non-flat surface. The distance of the two objects is determined based on longitude and latitude. Haversine is an algorithm that can determine the distance between two objects on the surface of a sphere. Haversine has now been developed by using a simple formula, which with computer calculations, can provide a very accurate level of precision between two points. Research with Haversine will be applied to determine the closest location. A graph is a diagram that contains specific information if interpreted correctly. The graph is used to describe various kinds of existing structures. The purpose is as a visualization of objects to make them easier to understand. The Haversine algorithm can determine the distance of two coordinates of the earth. By applying this method, the distance between the two coordinates can be determined.