Penyelesaian Capacitated Vehicle Routing Problem menggunakan modifikasi Algoritma Artificial Bee Colony

Muhaimini, Shufi Nurul (2024) Penyelesaian Capacitated Vehicle Routing Problem menggunakan modifikasi Algoritma Artificial Bee Colony. Sarjana thesis, UIN Sunan Gunung Djati Bandung.

Preview	Text (COVER) 1_cover.pdf Download (15kB) | Preview
Preview	Text (ABSTRAK) 2_abstrak.pdf Download (185kB) | Preview
Preview	Text (DAFTAR ISI) 3_daftarisi.pdf Download (209kB) | Preview
Preview	Text (BAB I) 4_bab1.pdf Download (312kB) | Preview
	Text (BAB II) 5_bab2.pdf Restricted to Registered users only Download (672kB) | Request a copy
	Text (BAB III) 6_bab3.pdf Restricted to Registered users only Download (573kB) | Request a copy
	Text (BAB IV) 7_bab4.pdf Restricted to Registered users only Download (3MB) | Request a copy
	Text (BAB V) 8_bab5.pdf Restricted to Registered users only Download (186kB) | Request a copy
	Text (DAFTAR PUSTAKA) 9_daftarpustaka.pdf Restricted to Registered users only Download (404kB) | Request a copy

Abstract

INDONESIA : Artificial Bee Colony (ABC) adalah salah satu metode optimasi yang banyak dikembangkan. Salah satu masalah optimasi di bidang industri yaitu Vehicle Routing Problem (VRP) dengan tujuan untuk menemukan rute optimal dari sejumlah kendaraan untuk melayani sejumlah pelanggan sesuai permintaannya. Rute terbaik adalah rute yang memiliki jarak paling minimum. VRP memiliki berbagai variasi, salah satunya adalah Capacitated Vehicle Routing Problem (CVRP). Dalam masalah ini setiap kendaraan memiliki kapasitas angkut pada setiap perjalanannya. Pada penelitian skripsi ini, penulis menganalisis perbandingan solusi yang dihasilkan dari ABC dasar dalam menyelesaikan CVRP dan juga modifikasi algoritma ABC. ENGLISH : Artificial Bee Colony (ABC) is one of the optimization methods. One of the optimization problems in the industrial domain is the Vehicle Routing Problem (VRP), aimed at finding the optimal routes for a fleet of vehicles to serve a set of customers based on their demands. The best route is the one with the minimum distance. VRP encompasses various variations, among which is the Capacitated Vehicle Routing Problem (CVRP). In this problem, each vehicle has a limited carrying capacity during each trip. In this thesis research, the author analyzes the comparison of solutions generated by basic ABC in solving CVRP, as well as modifications to the ABC algorithm.

Actions (login required)

View Item