Optimization of City Bus Routes in Surabaya Using Memetic Algorithm as a Solution to Solve Orienteering Problem

Abstract

The city of Surabaya is the largest metropolitan city in East Java and has a variety of tourist attractions that can be visited, such as shopping centres, theme parks, monuments, museums and historical places. As the second largest city in Indonesia, Surabaya has not escaped from traffic jams. Congestion is aggravated by the number of tourists out of town visiting the city of Surabaya using private vehicles. The Surabaya City Government seeks various ways to reduce traffic congestion, such as improving public transportation facilities and services in the city of Surabaya and increasing public awareness of the importance of using public transportation. To support this, a service is made that aims to optimize the selection of travel routes to various tourist objects in accordance with the time availability of tourists. In this research, the selection of city bus lines is seen as orienteering problem (OP). The city bus line used is as many as 10 routes. To find the optimal solution, Memetic Algorithm is used as a form of development of Genetic Algorithms. The addition of local search in Memetic Algorithms aims to find optimal solutions more efficiently. The local search algorithm that will be used is Hill Climbing and Simulated Annealing. Completion of OP problems is implemented using the Java programming language by comparing the results of the completion of three algorithms used, namely Genetic Algorithm (GA), Hill Climbing Memetic Algorithm (HCMA), and Simulated Annealing Memetic Algorithm (SAMA) using the best parameters of each algorithm. The results of the trial show that SAMA can provide the best fitness value solutions from HCMA and GA. So that SAMA can be said to be very feasible to be used to solve the OP problems in determining the optimal path using public transportation for city buses in Surabaya.