Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar
Keywords:Bus Rapid Transit, Genetic Algorithm, Roulette Wheel Method
AbstractBus Rapid Transit is a bus system that is fast, convenient, safe and on time from infrastructure, vehicles, and schedules. As a graph problem, BRT representation in a graph is done by assuming the bus stop as a vertex and the distance between bus stops is an edge. The problem examined in this paper is to find out the path that passes through all the bus stops with the smallest total distance, where the trip starts and ends at the same point, and all bus stops are crossed exactly once. The method used is the Genetic Algorithm, which works using objective and fitness functions, and combines selection, crossover and mutation operators to find the best solution. Using the roulette wheel, OX crossover method and a 0.07 of the probability of mutation, the distance of traverse from and to the departure point after passing all bus stops is 19.66 km or 12.22 miles.
Amin, A. R., Ikhsan, M., & Wibisono, L., 2003. Traveling Salesman Problem. Institut Teknologi Bandung.
Chartrand, G., & Zhang, P., 2005. Introduction to Graph Theory. McGraw-Hill, New York
Kumara Sastry, David Goldberg. https://pdfs.semanticscholar.org/ 8ed1/ d9f5a017c61abfec4089aba828b398aa3e7e.pdf (diakses 10 Junli 2019)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Jurnal Matematika, Statistika dan Komputasi is an Open Access journal, all articles are distributed under the terms of the Creative Commons Attribution License, allowing third parties to copy and redistribute the material in any medium or format, transform, and build upon the material, provided the original work is properly cited and states its license. This license allows authors and readers to use all articles, data sets, graphics and appendices in data mining applications, search engines, web sites, blogs and other platforms by providing appropriate reference.