Algoritma Particle Swarm Optimization Untuk Menyelesaikan Multi Depot Vehicle Routing Prolem Dengan Variabel Travel Time

Immanuel, Randi Mangatas (2015) Algoritma Particle Swarm Optimization Untuk Menyelesaikan Multi Depot Vehicle Routing Prolem Dengan Variabel Travel Time. Undergraduate thesis, Institut Technology Sepuluh Nopember.

[img]
Preview
Text
2210100006-Undergraduate Thesis.pdf - Published Version

Download (3MB) | Preview

Abstract

Multi Depot Vehicle Routing Problem (MDVRP) merupakan permasalahan optimasi yang memiliki peranan penting dalam manajemen sistem distribusi dengan tujuan meminimalkan waktu yang diperlukan, dimana penentuan waktu berkaitan dengan jarak dari rute yang ditempuh oleh armada distribusi. Penelitian ini memberikan sebuah formulasi dari kasus Multi Depot Vehicle Routing Problem (MDVRP) yang diselesaikan dengan metode algoritma Particle Swarm Optimization (PSO). Terdapat dua tahapan untuk menyelesaikan MDVRP yaitu clustering dan assignment. Dalam clustering digunakan metode simplified parallel assignment, sedangkan untuk assignment digunakan metode particle swarm optimization. PSO merupakan salah satu teknik komputasi. Algoritma Particle Swarm Optimization dapat menghasilkan waktu tempuh yang minimum yaitu 115 menit. ========================================================================================================= Multi Depot Vehicle Routing Problem (MDVRP) is an optimization problem which has an important role in the management of the distribution system with the aim of minimizing the travel time, where the timing related to the distance of the route taken by the fleet distribution[2]. This study provides a formulation of cases Multi Depot Vehicle Routing Problem (MDVRP) are solved by the method of Particle Swarm Optimization algorithm (PSO). There are two stages to complete MDVRP namely clustering and assignment. clustering using simplified parallel assignment methods, while the assignment using particle swarm optimization. PSO is a computational technique. Particle Swarm Optimization algorithm can generate the minimum travel time which is 115 minutes.

Item Type: Thesis (Undergraduate)
Additional Information: RSE 388.310 285 Imm a
Uncontrolled Keywords: MDVRP, optimasi, Particle Swarm Optimization, rute.
Subjects: Q Science > QA Mathematics > QA76.6 Computer programming.
Q Science > QA Mathematics > QA76.9 Computer algorithms. Virtual Reality. Computer simulation.
Divisions: Faculty of Industrial Technology > Electrical Engineering > 20201-(S1) Undergraduate Thesis
Depositing User: Mr. Tondo Indra Nyata
Date Deposited: 28 Jun 2018 03:43
Last Modified: 28 Jun 2018 03:43
URI: http://repository.its.ac.id/id/eprint/52056

Actions (login required)

View Item View Item