The shortest path search application based on the city transport route in Semarang using the Floyd-warshall algorithm

Abstract

City transportation is a motorized vehicle with a fixed line that connects one area to another in one city. Information about the city transportation route in Semarang has been provided by the Department of Transportation of Semarang city which contains the code and route. The development of science regarding the route search algorithm method or the shortest path can be used to support the path search based on the city transportation route. A geographical information system is a system designed to work using data that has spatial reference spatial information. At this time the technology has not been applied optimally to support the search for the shortest route of urban transport based on the city transportation route. This study aims to develop the application of the shortest pathway determination based on the city transportation route in Semarang using the Floyd Warshall algorithm based on Geographic Information System. City transportation route data can be implemented in graph form. The process of establishing a path graph is based on the road protocol traversed by Semarang city transportation. In this research, Floyd-warshall algorithm was successfully implemented in the Shortest Path Determination Application based on the City Transport Route in Semarang. Based on the results of testing the Floyd Warshall algorithm calculation by comparing manual calculations and calculations generated by the application, producing the path with the shortest distance the same so that the application gives the correct results. The results of usability testing which include aspects of ease, efficiency, easy to remember, errors and satisfaction in this application get a percentage overall 92,9% with very good qualification results. This application displays route maps. codes and trip descriptions from the initial position and destination position that can be selected by city transport users in Semarang

Intelligent Tourism Recommendation Algorithm based on Text Mining and MP Nerve Cell Model of Multivariate Transportation Modes

“…Especially when they choose different transportation modes, the same tour route may brings different motive satisfaction, that is, different transportation modes may generate different optimal tour routes. In the research area of tour route planning, there are commonly used methods such as Dijkstra algorithm, Floyd-Warshall algorithm, Bellman-Ford algorithm [56][57][58][59][60], etc. These algorithms mainly solve the TSP problem on the aspect of the shortest path and the least time consumption.…”

A 2-Phase Method for Solving Transportation Problems with Prohibited Routes

“…These paths are constructed in time proportional to their lengths according to Seidel (1995). Amongst Dijkstra's algorithm shown by Dijkstra (1959), Phil (2010) and Amoako (2019), Bellman-Ford algorithm, Johnson's algorithm as shown by Cormen et al (2001), and others is the Floyd's method by Floyd which was deliberately designed to solve shortest-route problems according to Khamami & Saputra (2019). The Floyd's algorithm by Floyd which is also also implemented by Ramadhan et al (2018), simultaneously calculates minimum weights of routes that connect a pair of points and all pairs of points in a network and it is widely used in determining shortest paths in a graph according to Iheonu & Inyama (2016).…”

“…Amoako (2019) defined a network as a set of points and a set of arcs connecting all pairs of the points where the arcs are associated with a flow. Khamami & Saputra (2019) used a modified version of the Floyd's method to develop a Shortest Path Determination Application (SPDA) to control transport routes in a city and the application yielded good results with accuracy, following a comparative analysis with results from the traditional Floyd's method. Kamal et al (2021) presented a Multi-Objective TP with type-2 trapezoidal fuzzy objective functions.…”