IMPLEMENTASI PEMILIHAN KENDARAAN UMUM BERTRAYEK DENGAN JARAK TERPENDEK MENGGUNAKAN METODE GENERATE AND TEST

  • Rimmar Siringo Ringo Komputerisasi Akuntansi, Universitas Imelda Medan

Abstrak

Medan is the largest metropolitan city outside Java and the third largest city in Indonesia after Jakarta and Surabaya, which has a comprehensive service from one location to another. Lack of information is often difficult to find the route and the number of public transport track the most optimum to travel from one location to another, because of the large number of public transport and existing route, causing many choices of paths that can be taken. By just looking
at a map and ask others, someone will take a long time to determine the types of public transit and public transportation route number that has the shortest distance to the destination location and sometimes the information may be inaccurate. In this study, the system to find the shortest distance between locations using the Generate and Test. The method work Generate and Test is a merger between Depth - First Search by backtracking, in which a solution must be raised in full prior to the test and also called backtracking procedures for when no knot that can be raised on one track and a solution has not been found then done
backtracking to the nearest node. The system is built using Microsoft Visual Basic 2008. The result of this system is in the form of a list of these public transport, public transportation

Referensi

[1] Aini, Dewi Yusra. 2010. Analisis Algoritma A* Dan Implementasinya Dalam Pencarian Rute Terpendek Pada Jalur Lintas Sumatera Di Provinsi Sumatera Utara. Skripsi. UniversitasSumatera Utara.
[2] Alamsyah. 2010. Pemanfaatan metode Heuristik pada pencarian jalur terpendek dengan algoritma genetika. Jurnal SMARTek. Vol. 8 No. 4: hal. 1-10.
[3] Munir, Rinaldi. 2007. Matematika Diskrit. Edisi Ketiga. Informatika Bandung : Bandung,Indonesia.
[4] Mutakhiroh, Iing., Saptono, Fajar., Hasanah ,Nur & Wiryadinata, Romi. 2007. Pemanfaatan metode Heuristik dalam pencarian jalur terpendek dengan algoritma semut dan algoritma genetika. Seminar Nasional Aplikasi Teknologi Informasi. ISSN: 1907-5022: hal. 1-7
[5] Nugroho, Adi. 2009. Algoritma dan Struktur Data dengan C#. Penerbit ANDI : Yogyakarta,Indonesia.
[6] Nurdiana, Dian. 2010. Implementasi Algoritma Lebah Untuk Pencarian Jalur Terpendek Dengan Mempertimbangkan Heuristik. Skripsi. Bandung, Indonesia : S1 Ilmu Komputer, Universitas Pendidikan Indonesia.
[7] Purwananto, Yudhi., Purwitasari, Diana & Wahyu Wibowo, Agung. 2005. Implementasi dan analisis algoritma pencarian rute terpendek di kota Surabaya. Jurnal Penelitian dan Pengembangan TELEKOMUNIKASI. Vol. 10 No.2: hal. 1-8.
[8] Silaban, Ferry. 2009. Perancangan Aplikasi Sistem Informasi Pemetaan Trayek Angkutan Umum Di Kotamadya Medan. Skripsi. Medan, Indonesia : S1 Ilmu Komputer Universitas Sumatera Utara.
[9] Sismoro, Heri. 2005. Pengantar Logika Informatika, Algoritma dan Pemograman Komputer. ISBN: 979-763-004-8. Penerbit ANDI : Yogyakarta
[10] Welianto, Selvy. Implementasi Algoritma Generate And Test Pada Pencarian Rute Terpendek. Jurnal. Yogyakarta, Indonesia: Teknik Informatika. Universitas Kristen Duta
Wacana.
Diterbitkan
2021-11-12