Penyelesaian Masalah Pendistribusian Barang Menggunakan Algoritma Bee Colony Optimization

Agnes Adventia, Khusnul Novianingsih, Husty Serviana

Abstract


ABSTRAK. Artikel ini membahas penyelesaian masalah pendistribusian barang agar diperoleh sebuah rute dengan jarak terpendek menggunakan Algoritma Bee Colony Optimization. Masalah pendistribusian yang dibahas adalah masalah pendistribusian dengan satu distributor dan banyak konsumen. Algoritma Bee Colony Optimization diadaptasi dari kehidupan koloni lebah dalam mencari makanan. Lebah pekerja akan mengambil makanan dan melakukan tarian untuk mengajak lebah pencari agar ikut mengambil makanan di suatu sumber makanan. Ketika sumber makanan habis, lebah pekerja akan berubah menjadi lebah pengintai untuk mencari sumber makanan baru. Hasil implementasi menunjukkan bahwa Algoritma Bee Colony Optimization berhasil diterapkan untuk menyelesaikan masalah pendistribusian barang dan dapat menghasilkan solusi yang cukup baik.

 

Kata Kunci: Pendistribusian Barang, Travelling Salesman Problem,  Algoritma Bee Colony Optimization, Solusi Optimal.

 

ABSTRACT. In this paper, a distribution problem in order to get an optimum route with shortest distance using Bee Colony Optimization Algorithm is solved. We consider a distribution problem with a single distributor and multi consumer. The bee colony optimization algorithm is an algorithm which is adapted from the behaviour of colony of bees in searching their food. Employed bees will collecting food and doing bee dance to invite onlooker bees to collect food in a source. When there’s no food left in the food source, employed bees will become scouts to search for a new source. The result shows that the algorithm successfully applied to solve the distribution problem and can produce an optimum solution.

 

Keywords:  Product Distribution, Travelling Salesman Problem, Bee   Colony Optimization, Optimum Solution.


Full Text:

PDF

References


Kusumah, R & Lesmono, J. (2016). Penerapan algoritma bee colony untuk menyelesaikan traveling salesman problem. Prosiding : Seminar Nasional Matematika, 11, hlm. MS 33-40.

Li, L., Cheng, Y., Tan, L., & Niu, B. (2012). Discrete artificial bee colony optimization for TSP problem. Lecture Notes in Computer Science, 6840, hlm. 566-573.

Li, L., Low, M.Y.H., Chong, C.S. (2008). A bee colony optimization algorithm for travelling salesman problem. Proceedings of Second Asia International Conference on Modelling & Simulation (AMS 2008), hlm 818-823.

Pathak, N. & Tiwari, S.P. (2012). Travelling salesman problem using bee colony with SPV. IJSCE, 2, hlm. 410-414.

Taha, H.A. (2010). Operations Research: An Introduction. New Jersey: Pearson Education.

Wong, L.P., Low, M.Y.H., & Chong C.S. (2009). An efficient bee colony optimization algorithm for traveling salesman problem using frequency-based pruning. IEEE International Conference on Industrial Informatics, 7, hlm. 775-782.




DOI: https://doi.org/10.17509/jem.v6i2.14851

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Agnes Adventia, Khusnul Novianingsih, Husty Serviana



  

 Google Scholar Logo PNG vector in SVG, PDF, AI, CDR format