PENYELESAIAN VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN MENGGUNAKAN ALGORITMA HONEY BEE MATING OPTIMIZATION

Lintang Arafah, - (2021) PENYELESAIAN VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN MENGGUNAKAN ALGORITMA HONEY BEE MATING OPTIMIZATION. S1 thesis, Universitas Pendidikan Indonesia.

Baca Full Text klik disini
[img] Text
S_MAT_1700297_Title.pdf
Download (430kB)
[img] Text
S_MAT_1700297_Chapter1.pdf
Download (291kB)
[img] Text
S_MAT_1700297_Chapter2.pdf
Restricted to Staf Perpustakaan
Download (694kB)
[img] Text
S_MAT_1700297_Chapter3.pdf
Download (632kB)
[img] Text
S_MAT_1700297_Chapter4.pdf
Restricted to Staf Perpustakaan
Download (678kB)
[img] Text
S_MAT_1700297_Chapter5.pdf
Download (281kB)
[img] Text
S_MAT_1700297_Appendix.pdf
Restricted to Staf Perpustakaan
Download (758kB)
Official URL: http://repository.upi.edu;

Abstract

Vehicle Routing Problem (VRP) adalah suatu masalah pencarian rute yang efisien dari sejumlah kendaraan yang harus melakukan perjalanan untuk mengantar dan/atau menjemput orang/barang. Vehicle Routing Problem with Time Windows (VRPTW) adalah perluasan dari VRP dengan adanya tambahan kendala berupa time windows atau batas waktu pelayanan dari masing-masing pelanggan. Tujuan penyelesaian VRPTW yaitu untuk menentukan rute optimal bagi setiap kendaraan agar menghasilkan biaya perjalanan seminimum mungkin. Dalam penelitian ini, akan diterapkan Algoritma Honey Bee Mating Optimization (HBMO), yaitu algoritma yang terinspirasi dari perilaku koloni lebah saat bereproduksi, untuk penyelesaian VRPTW. Algoritma HBMO bekerja dengan cara merepresentasikan kromosom, membangkitkan populasi, menghitung nilai fitness, seleksi, flight-mating, crossover, dan mutasi. Hasil implementasi model VRPTW dan Algoritma HBMO pada masalah pendistribusian katering di sebuah perusahaan di Kota Bandung menunjukan bahwa Algoritma HBMO dapat menyelesaikan VRPTW dan mampu memberikan solusi jalur pendistribusian dengan biaya yang minimum. Vehicle Routing Problem (VRP) is a problem to find an efficient route for number of vehicles. The vehicles should deliver and (or) pick up people or goods. Vehicle Routing Problem with Time Windows (VRPTW) is the extension of VRP, that is by including time windows or service time limits from each customer as additional constraints. We solve VRPTW to determine the optimal route for each vehicle with minimum total costs. In this study, the Honey Bee Mating Optimization (HBMO) Algorithm will be applied to solve the problem. Inspired by the reproductive behavior of bee colonies, the algorithm works by representing chromosomes, generating populations, calculating fitness values, selection, flight-mating, crossover, and mutation. The computational results show that both VRPTW model and HBMO Algorithm can be implemented to solve the problem of katering distribution in and able to provide

Item Type: Thesis (S1)
Uncontrolled Keywords: Algoritma Honey Bee Mating Optimization (HBMO), Vehicle Routing Problem with Time Windows (VRPTW), Solusi Optimal, Pendistribusian.
Subjects: L Education > L Education (General)
Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Lintang Arafah
Date Deposited: 11 May 2021 06:23
Last Modified: 11 May 2021 06:23
URI: http://repository.upi.edu/id/eprint/60640

Actions (login required)

View Item View Item