@thesis{thesis,
		author={AULIYAH  RARA and Sudirman  M. Yoga Distra and Yosrita  Efy},
		title ={RANCANG BANGUN APLIKASI BABE GALON DENGAN MENGGUNAKAN PENDEKATAN HAVERSINE CLOSEST PAIR (STUDI KASUS: WARALABA TRADISIONAL KEL. DURI KOSAMBI)},
		year={2018},
		url={http://156.67.221.169/4622/},
		abstract={The purpose of this study is to provide an alternative to facilitate the community
in the Duri Kosambi Village in purchasing gallons, liquefied petroleum gas, and
food ingredients because there are still many people who are lazy to make
purchases in traditional franchises, lack of information about price comparisons
between traditional franchises and each other and difficulties in doing purchases
when the nearest traditional franchise closes. So in this study the gallon ordering
application was built using the Haversine Closest Pair. Haversine Closest Pair is
the closest search method from a point. The software development model will be
implemented with the steps of the Waterfall methodology and UML modeling.
From this study, the Babe Galon Application is produced by displaying several
stores and sorting them based on the closest distance from the order location.
Testing used in this project is Black Box based on Use Case.}
		}