Melola Discovery

← Melola Discovery

Jurnal

Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar

Jurnal Matematika, Statistika dan Komputasi · Vol. 16 No. 2 (2019) · hlm. 114–120

DOI
10.20956/jmsk.v16i2.7016
ISSN
2614-8811, 1858-1382
Terbit
2019-12-19
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en

Abstrak

Bus 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.

Kata kunci

Jaringan kolaborasi para penulis

14 penulis · 22 tautan kepenulisan bersama · 3 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Hasanuddin University
  • State University of Makassar
  • Politeknik Negeri Ujung Pandang
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Naimah ArisHasanuddin University3
Budi NurwahyuHasanuddin University3
Muh. NurHasanuddin University2
Khaeruddin KhaeruddinState University of Makassar1
Faisal FaisalPoliteknik Negeri Ujung Pandang1
Islamiyah AbbasAfiliasi tidak diketahui1
Muh Ali ImranHasanuddin University1
Aswad Hariri MangalaengHasanuddin University1
Indi Ria Al KadryHasanuddin University1
Ervie Yuniarti Astika MustafaputriHasanuddin University1
Heryati Nur Fatimah SariHasanuddin University1
Dermawan SaputraHasanuddin University1
Cindy CindyAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar</dc:title>
	<dc:creator xml:lang="en">Massalesse, Jusmawati</dc:creator>
	<dc:subject xml:lang="en">Bus Rapid Transit</dc:subject>
	<dc:subject xml:lang="en">Genetic Algorithm</dc:subject>
	<dc:subject xml:lang="en">Roulette Wheel Method</dc:subject>
	<dc:description xml:lang="en">Bus 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.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2019-12-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/7016</dc:identifier>
	<dc:identifier>10.20956/jmsk.v16i2.7016</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 16 No. 2 (2020): JMSK, JANUARY, 2020; 114-120</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/7016/4544</dc:relation>
	<dc:relation>10.20956/j.v16i2.7016.g4544</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2019 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
</oai_dc:dc>