Implementation of Dijkstra's Algorithm to Find a School Shortest Distance Based on The Zoning System in South Tangerang

— School is an essential thing for education quality. This time, the South Tangerang government is implementing a new student admission process using a zoning system; all prospective students must choose a school that has the shortest distance from their residence. However, many parents and prospective students do not understand this zoning system. The limited access to information is a problem for them, so they do not know where the schools are included in their zoning area. For this reason, the need to efforts the problem-solve to use Dijkstra's algorithm as a consideration to find the results more accurate for the shortest distance. So the exact solution that should implement the information technology this time is "Implementation of Dijkstra's Algorithm to Find a School Shortest Distance Based on The Zoning System In South Tangerang." It is a solution for parents and prospective students to get information about school choices included in their zoning.


I. INTRODUCTION
School is an essential thing for education quality. The children will get good knowledge and skills with a good education for their future. So, the parents and the children must choose the right school according to the children's passion and abilities. However, this time the admission process of prospective new students uses a zoning system, where all prospective students must choose a school that has the shortest distance from their residence. The South Tangerang government decides the zoning distance for elementary school is a maximum of 3 kilometers, junior high school zoning is between 5 to 7 kilometers, and senior high school or vocational high school zoning is between 9 to 10 kilometers [1].
At the first time, the zoning system was made to provide access to education quality and realize an education center in school, family, and society to go to school in the neighborhood. All schools run by local governments must accept prospective new students who live in the zone shortest to the school, at least 90% of the total student accepted. And 10% of the total students are divided into two criteria, that is 5% for outside admission a school shortest zoning, and another 5% for students who change residence or for student get disaster occurs [2]. The local government must accept free education fees for the new student's low-income families that live in one zoning area. This zoning system rule applies to all regions in Indonesia except for sites where the number of schools available doesn't allow for this system [3].
This time, the South Tangerang government was also implemented a school zoning system. Many parents and prospective students do not understand this zoning system. The limited access to information is a problem for them, so they do not know where the schools are included in their zoning area. And they don't know about the school profile, the school majors available, the school status is a public school or private school, and the quality of these schools. Many parents and prospective new students only rely on information from relatives and neighbors to get about school information that they will do it or go schools to get information. If they come to school to get information, the South Tangerang area implements Large-Scale Social Restrictions during the Covid-19 pandemic. It is made complex and risky for them to get information.
So the exact solution that should implement the information technology this time is "Implementation of Dijkstra's Algorithm to Find a School Shortest Distance Based on The Zoning System In South Tangerang." It is a solution for parents and prospective students to get information about school choices included in their zoning. This research uses Dijkstra's algorithm method. It's used consideration to find the shortest distance, and the result is more accurate.
Dijkstra's algorithm needs parameters like starting point and destination point [4]. Dijkstra's algorithm is suitable for this research because it's easy for users and if used only to determine the starting point and the destination point [21]. This research is to find out the information on the  After the mapping process, the schools for each sub-district, then determine longitude and latitude for each school use the tracking method so need GPS (Global Positioning System) [6].
There are 355 schools in the South Tangerang region which are the research objects, starting from SD, SMP, and SMK or SMA. Below is a table of some school data. The contents table are the name of schools, addresses, and locations based on latitude and longitude. Then the next step is to use the method Dijkstra's algorithm in this research. Dijkstra's algorithm as a consideration that to find for the shortest distance the results more accurate [7]. As an illustration of Dijkstra's algorithm, so will calculate the shortest distance from K1 to K6 by testing all paths. So the shortest distance from K1 to K6 is 7, the path is K1→K4→K5→K6 Dijkstra's algorithm needs parameters from starting point and destination point [21]. The parameter contains a route like (vertex) or vertices in the plural for comparison. Each side of this route is a pair of vertices (a, b) representing the relationship from vertex a to vertex b.

III. RESULT AND DISCUSSION
This research process analyzes the system's flow based on user needs so the design of this application can be developed. The following flowchart describes determining the shortest distance to the school location using Dijkstra's algorithm. The flowchart determines the shortest distance using Dijkstra's algorithm above the first step system will initialize user position (starting point). Then the system will detect the nearest school. After that, the system recommends the closest schools to display the names of these schools. Afterward, the user selects the destination school, and the system will identify the user position as the starting point to the school designated as the end node. And then, the system determines a path by comparing between vertices. If the vertices have not been passed, the system will find a way back by comparing between vertices [8]. However, if the vertices have been given, the system will sign the path passed. The final step of the system will be to decide or choose the shortest distance to the school.
When the shortest distance has been determined using Dijkstra's algorithm, calculate the spread between coordinates. The Haversine formula starts from the current location of user coordinates to the shortest of school location coordinates. The Haversine formula is used to find the distance between two points on the earth's surface [9]. This research calculates the user distance to each school to see the shortest distance. The system does the distance calculation to select the user position on the map. It then reveals the shortest school recommendation from the user position. This process needs several parameters. The initial coordinate parameter is the user position, and the end coordinate is the nearest school position. These parameters will be calculated to get distance comparisons using the Haversine formula [14]. The design of this application has school levels from elementary school until senior high school. When the user uses this application for the first time, it will display a red pin symbol as school distribution in the South Tangerang area on the map.   To determine the nearest school from the user's position, the user must select the school level corresponding and click the user position button. As a result, the system will display the map of the shortest distance from the user's current position to school, and the system will determine one of the schools that has the shortest distance to the user's post based on GPS.