Algoritma Simulated Annealing Untuk Menyelesaikan Multi Depot Vehicle Routing Problem Dengan Variabel Travel Time

Sinaga, Raymond Lamhot (2015) Algoritma Simulated Annealing Untuk Menyelesaikan Multi Depot Vehicle Routing Problem Dengan Variabel Travel Time. Undergraduate thesis, Institut Technology Sepuluh Nopember.

[img]
Preview
Text
2210100166-Undergraduate Theses.pdf - Published Version

Download (3MB) | Preview

Abstract

Beberapa tahun terakhir ini manajemen pengiriman barang menjadi perhatian bagi perusahaan-perusahaan besar. Maka dari itu dibutuhkan sistem distribusi yang efisien, sehingga permintaan dari konsumen dapat terpenuhi dengan tepat waktu. Pada tugas akhir ini membahas optimasi sistem distribusi pada perancangan rute dan penjadwalan. Permasalahan ini dapat dimodelkan sebagai Vehicle Routing Problem (VRP). VRP sendiri memiliki beberapa pengembangan seperti Multi Depot Vehicle Routing Problem (MDVRP), yang mana sebuah perusahaan memiliki lebih dari satu depot. Berdasarkan hasil penelitian ini, algoritma Simulated Annealing dapat menyelesaikan permasalahan MDVRP yang menghasilkan rute kendaraan dengan travel time yang minimum. ========================================================================================================== In recent years, management of logistics delivery to the attention of several major companies. And so we need an efficient distribution system that consumer demand for good logistics distribution and can be met on time. This paper discusses the optimization of the distribution system which includes route and scheduling design. These problems can be modeled by Vehicle Routing Problem (VRP). VRP itself has some development such as Multi Depot Vehicle Routing Problem (MDVRP), in which a company has more than one depot. Based on these results, Simulated Annealing algorithm can solve MDVRP problem that produce vehicles with the minimum travel time.

Item Type: Thesis (Undergraduate)
Additional Information: RSE 388.310 285 Sin a
Uncontrolled Keywords: MDVRP, optimasi, Simulated Annealing, travel time
Subjects: Q Science > QA Mathematics > QA76.9 Computer algorithms. Virtual Reality. Computer simulation.
T Technology > TE Highway engineering. Roads and pavements > TE7 Transportation--Planning
Divisions: Faculty of Industrial Technology > Electrical Engineering > (S1) Undergraduate Theses
Depositing User: Mr. Tondo Indra Nyata
Date Deposited: 13 Jul 2018 02:37
Last Modified: 13 Jul 2018 02:37
URI: http://repository.its.ac.id/id/eprint/52218

Actions (login required)

View Item View Item