PENERAPAN ALGORITMA BEE COLONY OPTIMIZATION PADA PENYELESAIAN MULTIPLE TRAVELLING SALESMAN PROBLEM: Studi Kasus Perusahaan Paragon di Kota Jakarta

Nadya Haniyah, - and Khusnul Novianingsih, - and Husty Serviana Husain, - (2025) PENERAPAN ALGORITMA BEE COLONY OPTIMIZATION PADA PENYELESAIAN MULTIPLE TRAVELLING SALESMAN PROBLEM: Studi Kasus Perusahaan Paragon di Kota Jakarta. S1 thesis, Universitas Pendidikan Indonesia.

Abstract

Penelitian ini mengkaji penerapan Algoritma Bee Colony Optimization Pada Penyelesaian Multiple Travelling Salesman Problem, yaitu masalah penentuan rute salesman agar total jarak tempuh yang dilaluinya seminimum mungkin. Algoritma ini diadaptasi dari perilaku koloni lebah dalam mencari sumber makanan. Terdapat 3 jenis lebah yaitu, lebah pekerja, lebah pengamat, dan lebah pengintai yang akan mencari sumber makanan. Lebah pekerja bertugas untuk mencari sumber makanan, lebah pengamat bertugas untuk menunggu di sarang dan mendapatkan sumber makanan melalui informasi yang disampaikan oleh lebah pekerja melalui waggle dance, lebah pengintai bertugas untuk mengintai sumber makanan dan akan mencari sumber makanan baru jika sumber makanan sebelumnya ditinggalkan oleh lebah pekerja dan lebah pengamat telah habis. Hasil implementasi algoritma Bee Colony Optimization pada penyelesaian masalah penentuan rute menunjukkan bahwa metode yang digunakan mampu memberikan solusi rute pendistribusian yang optimal bagi setiap salesmen yang ada. This research examines the application of the Bee Colony Optimization Algorithm in solving the Multiple Travelling Salesman Problem, which is the problem of determining the salesman’s route to minimize the total distance traveled. This algorithm is adapted from the behavior of a bee colony in searching for food sources. There are three types of bees: worker bees, observer bees, and scout bees that seek food sources. Worker bees are responsible for searching for food, observer bees wait in the hive and receive food sources through information conveyed by worker bees via waggle dance, and scout bees are tasked with exploring food sources and will search for new food if the previous sources are abandoned by worker bees and the food resources for observer bees have run out. The implementation results of the Bee Colony Optimization algorithm in solving the routing problem show that the method used is able to provide an optimal distribution route solution for each salesman.

	Text S_Mat_1806959_Title.pdf Download (2MB)
	Text S_Mat_1806959_Chapter1.pdf Download (107kB)
	Text S_Mat_1806959_Chapter2.pdf Restricted to Staf Perpustakaan Download (1MB)
	Text S_Mat_1806959_Chapter3.pdf Download (230kB)
	Text S_Mat_1806959_Chapter4.pdf Restricted to Staf Perpustakaan Download (889kB)
	Text S_Mat_1806959_Chapter5.pdf Download (77kB)
	Text S_Mat_1806959_Appendix.pdf Restricted to Staf Perpustakaan Download (88kB)

Item Type:	Thesis (S1)
Additional Information:	https://scholar.google.com/citations?view_op=new_profile&hl=en ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Husty Serviana Husain: 6121538
Uncontrolled Keywords:	Multiple Travelling Salesman Problem, Algoritma Bee Colony Optimization, Rute Salesman, Solusi Optimal. Multiple Traveling Salesman Problem, Bee Colony Optimization Algorithm, Salesman's Route, Optimal Solution.
Subjects:	L Education > L Education (General) Q Science > QA Mathematics
Divisions:	Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
Depositing User:	Nadya Haniyah
Date Deposited:	16 Sep 2025 01:12
Last Modified:	16 Sep 2025 01:12
URI:	http://repository.upi.edu/id/eprint/139461

Actions (login required)

View Item