Penerapan Bee Colony Optimization Algorithm untuk Penentuan Rute Terpendek (Studi Kasus : Objek Wisata Daerah Istimewa Yogyakarta)

https://doi.org/10.22146/ijccs.3053

Danuri Danuri(1*), Widodo Prijodiprodjo(2)

(1) Jurusan Teknik Informatika, Politeknik Negeri Bengkalis, Bengkalis
(2) Jurusan Ilmu Komputer dan Elektronika, FMIPA UGM, Yogyakarta
(*) Corresponding Author

Abstract


Abstrak

Pencarian rute terpendek merupakan suatu permasalahan optimasi yang sering dijadikan studi kasus bagi penelitian. Jarak merupakan faktor yang paling menentukan dalam melakukan penelusuran jalur-jalur yang akan dilalui. Jalur dengan jarak terpendek akan dipilih sebagai jalur pilihan.

Algoritma bee colony optimization digunakan dalam penelitian ini untuk menyelesaikan permasalah pencarian rute terpendek. Terdapat dua proses utama pada saat penelusuran jalur yaitu forward dan backward. Algoritma bee colony optimization bekerja pada proses forward. Nilai probabilitas suatu jalur dijadikan dasar pada proses transisi jalur kemudian durasi waggle dance dari tiap lebah yang berhasil menemukan posisi tujuan akan dijadikan rute pilihan.

Hasil yang diperoleh dalam penelitian ini adalah algoritma bee colony optimization dapat digunakan untuk menemukan rute terpendek. Jumlah lebah yang dilepas sangat mempengaruhi dalam menemukan rute-rute yang bisa dilalui. Semakin banyak jumlah lebah yang dilepas semakin besar peluang ditemukannya rute terpendek.

 

Kata kunci— Rute Terpendek, Algoritma Bee Colony Optimization.

 

 

Abstract

The shortest path determination is an optimization problem which often used as a case study for research. Distance is the most defining factor in performing the search paths to be passed. Path with the shortest distance would be chosen as a path selection.

Bee colony optimization algorithm used in this study to complete problems shortest path determination. There are two main process es during search path that is forward and backward. Bee colony optimization algorithm works on the process forward. The value probability of a path is base intransition process and the duration of waggle dance track of every bee who had found the position of the goal will be a preferred route.

The results obtained in this study is the bee colony optimization algorithm can be used to find shortest path. The number of bees are released greatly affects in finding routes that can be passed. The more the number of bees that removed the greater the chances of finding the shortest path.

 

Keyword— Shortest Path, Bee Colony Optimization Algorithm


Keywords


Shortest Path; Bee Colony Optimization Algorithm

Full Text:

PDF


References

[1] Siang, J. J., 2009, Matematika Diskrit dan Aplikasinya pada Ilmu Komputer, Andi, Yogyakarta .

[2] Wong,L., Low, M.Y.H., and Chong, C.S., 2008,Bee Colony Optimization with Local Search for Traveling Salesman Problem, Proceeding of 6th IEEE International Conference on Industrial Informatics (INDIN 2008),Daejeon – Korea, 13 - 16 Juli 2008, 1019 – 1025.

[3] Wong,L., Low, M.Y.H., and Chong, C.S., 2009, An Efficient Bee Colony Optimization Algorithm for Traveling Salesman Problem using Frequency based Pruning,Proceedings of 7th IEEE International Conference on Industrial Informatics (INDIN 2009), Wales – United Kingdom, 23-26 Juni 2009, 775 – 782.

[4] Bonabeau, E., Dorigo, M., dan Theraulaz, G., 1999, Swarm Intelligence from Natural to Artificial Systems, Oxford University Press, New York.

[5] Teodorovic, D., 2009, Bee Colony Optimization (BCO), http://www.sf.bg.ac.rs/downloads/katedre/oi/1.BCO-Book-Chapter.pdf,

diakses 03 Oktober 2011.

[6] Kaur, A., Goyal, S., 2011, A Survey on the Applications of Bee Colony Optimization Techniques, International Journal on Computer Science and Engineering(IJCSE), India, 8 Agustus 2011, vol. 3, 3037 – 3046, ISSN : 0975 – 3397.



DOI: https://doi.org/10.22146/ijccs.3053

Article Metrics

Abstract views : 7911 | views : 12168

Refbacks

  • There are currently no refbacks.


Bookmark and Share


Copyright (c) 2013 IJCCS - Indonesian Journal of Computing and Cybernetics Systems

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


Copyright of :
IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
ISSN 1978-1520 (print); ISSN 2460-7258 (online)
is a scientific journal the results of Computing
and Cybernetics Systems
A publication of IndoCEISS.
Gedung S1 Ruang 416 FMIPA UGM, Sekip Utara, Yogyakarta 55281
Fax: +62274 555133
email:ijccs.mipa@ugm.ac.id | http://jurnal.ugm.ac.id/ijccs


View My Stats1
View My Stats2