Authors:
I Wayan Suasnawa
;
I Sudiartha
;
I Gusti Ngurah Bagus Caturbawa
;
Anak Agung Ngurah Gde Sapteka
;
I Indrayana
and
I Sunaya
Affiliation:
Department of Electrical Engineering, Politeknik Negeri Bali, Kampus Bukit Jimbaran, Badung, Indonesia
Keyword(s):
Bus Routes, Differential Evolution, Mutation, Crossover, Selection.
Abstract:
The Denpasar City Transportation Office has launched school buses for school students since 2017. Through this school bus, The Denpasar City Transportation Office has helped parents to pickup students. The problem that often occurs in the transportation system is finding the optimal route. The purpose of this study is to create a method to get an effective route, namely, in the form of the shortest route. Route selection uses the Differential Evolution algorithm. At the initialization stage, the Differential Evolution algorithm generates a population (random route). The random route generated has a distance of between 46.976602126788194 km to 9999 km. A score of 9999 is not the true distance, but the score assigned to a bad individual candidate. Considered as a bad individual candidate because the random route generated was the pickup location as the final destination. Furthermore, each individual goes through a process of mutation, recombination, selection with a certain number of i
terations. The system will produce a better population, with shorter routes with each iteration. With the selection process, shorter route variations that result from iterations replace routes with longer distances. The Differential Evolution algorithm is very effective to use to get the minimum value. Based on the final results obtained from the application, the optimal route candidates are obtained. The farthest route is 26.624917440178955 km, and the route with the shortest distance is 25.75039590845092 km.
(More)