Optimasi Jarak Terpendek Kunjungan Pegawai Cabang Dinas Kehutanan Lumajang Pada Integrated Area Development dengan Firefly Algorithm

Abstract

Employees of the Lumajang Region Forestry Branch Office (CDK) are required to carry out visits to various IAD program locations spread across several villages in Lumajang Regency. In current practice, the determination of travel routes is often done without calculating the shortest possible paths, which can result in inefficient travel distances and increased travel times. This condition underscores the need for an optimization approach that enables employees to determine the most efficient travel routes. This study applies the Firefly Algorithm to determine the shortest travel routes for CDK Lumajang employees. The data used in this research consists of a distance matrix with the CDK office as both the starting and ending point. Route optimization is conducted over two visit days, with the first day featuring 10 IAD locations and the second day comprising 12 IAD locations. Before the research test was conducted, the total distance covered was 64.25 km on the first day and 94.58 km on the second day. The study's results indicate that the optimal travel route on the first day covers a total distance of 63.95 km, while the optimal route on the second day spans a total distance of 93.03 km. In parameter testing, the combination of parameter values 𝛼 = 0.2, 𝛾 = 1, and 𝛽₀ = 1, using 𝑛 = 50 and a maximum of 500 iterations, yielded the best results by producing the shortest route, namely the optimal travel route on the first day covering a total distance of 63.95 km, while the optimal route on the second day covering a total distance of 92.93 km.. Testing variations in these parameters affected the shortest distance obtained. These findings indicate that the Firefly Algorithm can solve the problem of travel routes for CDK employees in the Lumajang Region to IAD's fostered locations.