The Bellman-Ford Algorithm Search for the Best Routes to Tourist Attractions amid the COVID-19 Pandemic

ABSTRACT

Banyumas Regency is one of the districts rich in tourism potential, located in Central Java, Indonesia, with the state of the land-mountain transition zone. This natural potential has finally provided Banyumas with many advantages, especially in tourism. The tourist sites in Banyumas are located downtown, in a mountainous area, and in Baturraden. Banyumas has a very rapid development in economic growth, tourism, culture, and so forth. One of the causes of this growth is the high community travel activities drive it. The Covid-19 pandemic has impacted negatively on Indonesia's tourism industry and creative economy, particularly Banyumas. The number of domestic and foreign tourists experienced a very drastic decline, also experiencing a decline in hotel occupancy. This has an effect on the tourism industry's local revenue. Banyumas tourism management through the relevant agencies also makes efforts to save tourism from attracting tourists and revive the ecosystem. Many tourist locations are attractive, so people need to choose the fastest route to cross between them to get time efficiency when travelling between tourist attractions. In this paper, we are several ways to find the fastest path optimization for connecting one node with another node with the Bellman-Ford Algorithm. The results show that the Bellman-Ford Algorithm produces the shortest and fastest route with node routes 10-8-9-16-13-5-11-17-7-4-3-6-14-15-18-2-12. Determining the shortest path is essential in supporting tourism services to reach tourist sites easily.