Optimizing Art Studio Connectivity: A Haversine and Greedy Algorithm Approach for Navigation in Cirebon Indonesia

The proposed geographic information system (GIS) provides a systematic approach to locating and connecting art studios, enabling cultural institutions, artists, and students to collaborate and share resources more efficiently. The implementation of a structured GIS and Haversine Formula and Greedy Algorithm can improve the management and connectivity of art studios in Cirebon, fostering connections and collaboration between art studios, artists, and cultural institutions. This research used a greedy algorithm to find the shortest route from user’s current location to the destination point, i.e., Art Gallery. The Greedy Algorithm is a problem-solving approach that aims to find an optimal solution by iteratively selecting the best local option. The Haversine formula is used to calculate the distance from each connected node using the haversine formula, which converts latitudes and longitudes from degrees to radians and calculates the differences in latitude and longitude. In implementing the nearest art studio search system, the Haversine Formula combined with Greedy Algorithm can be employed as an alternative for search logic since it can directly calculate the distance from the initial point or user’s selected point by utilizing easily identifiable reference points.