Determine the Shortest Path Problem Using Haversine Algorithm, A Case Study of SMA Zoning in Depok

Diana Ikasari, Widiastuti, Rheza Andika
{"title":"Determine the Shortest Path Problem Using Haversine Algorithm, A Case Study of SMA Zoning in Depok","authors":"Diana Ikasari, Widiastuti, Rheza Andika","doi":"10.1109/HORA52670.2021.9461185","DOIUrl":null,"url":null,"abstract":"The new student admission evolves with government rules which are described in the ministerial decrees. Zoning is suite of policies that are intact, integrated, and systematic in attempt to do a restoration in educational field. The new student admission is applied with zoning system, based on Depok Mayor Regulation No. 20 of 2020, Technical Instructions for Admission of New Students, 2020 that admission of new student from Depok with the nearest distance has fifty percent quota as evidenced by Family Registration Card and scoring based on the nearest sub-district. Problem that occurs is how to determine and count the domicile distance to destination school with straight line calculation and get the nearest distance that corresponding to the student school zone. This research begins by collecting spatial and non-spatial data from high school in Depok and continued with calculating the nearest distance from student’s domicile to destination school using Haversine Algorithm. The Haversine Algorithm is used to calculate the distance between two points on earth based on the length of a straight line without ignore curvature that earth has. The result of this research shows recommendation about the destination school which corresponds with the nearest distance from user’s location.","PeriodicalId":270469,"journal":{"name":"2021 3rd International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HORA52670.2021.9461185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The new student admission evolves with government rules which are described in the ministerial decrees. Zoning is suite of policies that are intact, integrated, and systematic in attempt to do a restoration in educational field. The new student admission is applied with zoning system, based on Depok Mayor Regulation No. 20 of 2020, Technical Instructions for Admission of New Students, 2020 that admission of new student from Depok with the nearest distance has fifty percent quota as evidenced by Family Registration Card and scoring based on the nearest sub-district. Problem that occurs is how to determine and count the domicile distance to destination school with straight line calculation and get the nearest distance that corresponding to the student school zone. This research begins by collecting spatial and non-spatial data from high school in Depok and continued with calculating the nearest distance from student’s domicile to destination school using Haversine Algorithm. The Haversine Algorithm is used to calculate the distance between two points on earth based on the length of a straight line without ignore curvature that earth has. The result of this research shows recommendation about the destination school which corresponds with the nearest distance from user’s location.
用Haversine算法确定最短路径问题——以Depok SMA分区为例
新的学生入学制度随着政府的规定而发展,这些规定在部令中有所描述。分区是一套完整的、完整的、系统的政策,试图对教育领域进行修复。新生录取采用分区制,根据2020年德博克市长条例第20号《2020年新生录取技术细则》,从距离最近的德博克录取新生,以家庭登记卡和最近的街道评分为依据,占50%的名额。遇到的问题是如何用直线计算确定和计算住所地到目的学校的距离,并得到与学生学校区域相对应的最近距离。本研究首先收集了Depok高中的空间和非空间数据,然后使用Haversine算法计算学生住所到目的学校的最近距离。Haversine算法在不忽略地球曲率的情况下,根据直线的长度计算地球上两点之间的距离。该研究结果显示了与用户位置最近的距离相对应的目的地学校的推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信