Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Resolving the shortest path problem using the haversine algorithm

Prasetya, Dwi Arman ; Nguyen, Phong Thanh ; Faizullin, Rinat ; Iswanto, Iswanto and Armay, Edmond Febrinicko LU orcid (2020) In Journal of Critical Reviews 7(1). p.62-64
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... (More)

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.

(Less)
Please use this url to cite or link to this publication:
author
; ; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Artificial, Haversine, Intelligence, Shortest path
in
Journal of Critical Reviews
volume
7
issue
1
pages
3 pages
publisher
Innovare Academics Sciences Pvt. Ltd
external identifiers
  • scopus:85077648314
ISSN
2394-5125
DOI
10.22159/jcr.07.01.11
language
English
LU publication?
yes
id
22de05fb-cd8b-496b-b6da-77bced3e3ba6
alternative location
http://www.jcreview.com/?mno=302645134
date added to LUP
2020-01-29 14:44:16
date last changed
2022-04-18 20:05:16
@article{22de05fb-cd8b-496b-b6da-77bced3e3ba6,
  abstract     = {{<p>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.</p>}},
  author       = {{Prasetya, Dwi Arman and Nguyen, Phong Thanh and Faizullin, Rinat and Iswanto, Iswanto and Armay, Edmond Febrinicko}},
  issn         = {{2394-5125}},
  keywords     = {{Artificial; Haversine; Intelligence; Shortest path}},
  language     = {{eng}},
  number       = {{1}},
  pages        = {{62--64}},
  publisher    = {{Innovare Academics Sciences Pvt. Ltd}},
  series       = {{Journal of Critical Reviews}},
  title        = {{Resolving the shortest path problem using the haversine algorithm}},
  url          = {{http://dx.doi.org/10.22159/jcr.07.01.11}},
  doi          = {{10.22159/jcr.07.01.11}},
  volume       = {{7}},
  year         = {{2020}},
}