Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/154721
Title: | Masalah Penentuan Rute Kendaraan Listrik Multi-Depot dengan Time Windows |
Other Titles: | Multi-Depot Electric Vehicle Routing Problem with Time Windows |
Authors: | Bakhtiar, Toni Jaharuddin Tan, Elfina |
Issue Date: | 2024 |
Publisher: | IPB University |
Abstract: | Dunia sedang menghadapi masalah perubahan iklim yang salah satu
penyebabnya adalah emisi gas rumah kaca. Emisi gas rumah kaca dapat dikurangi dengan menggunakan kendaraan listrik. Kendaraan listrik memiliki jarak tempuh
yang terbatas. Oleh karena itu, perlu dilakukan penentuan rute optimal, salah satunya adalah penentuan rute kendaraan listrik multi-depot dengan time windows.
Tujuan dari penelitian ini adalah memodelkan masalah penentuan rute kendaraan
listrik multi-depot dengan time windows dalam model MDEVRPTW dan menyelesaikannya dengan mixed integer linear programming. Biaya yang
diminimumkan meliputi biaya tetap kendaraan, biaya perjalanan, biaya pengisian
daya, dan biaya penalti jika melanggar time windows. Kendaraan diperbolehkan
melanggar time windows dengan toleransi waktu 5 menit dari time windows setiap
lokasi. Model ini diimplementasikan dalam dua kasus yang dibagi menjadi lima
skenario per kasus. Setiap skenario memiliki perbedaan dalam kapasitas baterai,
kapasitas muatan, dan time windows pelanggan. Pada kasus pertama, kendaraan
harus kembali ke depot asalnya, sedangkan pada kasus kedua, kendaraan bisa
kembali ke depot terdekat. Solusi yang dihasilkan berupa rute kendaraan listrik yang meminimumkan total biaya untuk setiap skenario dan kasus, dan memenuhi
semua kendala yang ditetapkan. The world is currently facing the issue of climate change, one of the causes is greenhouse gas emissions. Greenhouse gas emissions can be reduced by using electric vehicles. However, electric vehicles have a limited range. Therefore, it is necessary to determine the optimal route, one of which is the multi-depot electric vehicle routing problem with time windows. The aim of this research is to model the multi-depot electric vehicle routing problem with time windows in the MDEVRPTW model and solve it using mixed integer linear programming. The costs minimized in this problem include vehicle fixed costs, travel costs, charging costs, and penalty costs for violating time windows. Vehicles are allowed to violate time windows with a tolerance of 5 minutes. This model is implemented in two cases, each divided into five scenarios. Each scenario differs in vehicle battery capacity, vehicle load capacity, and customer time windows. In the first case, vehicles must return to their original depot, while in the second case, vehicles can return to the nearest depot. The result is the electric vehicle route that minimizes total costs for each scenario and case, and meets all the specified constraints. |
URI: | http://repository.ipb.ac.id/handle/123456789/154721 |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
cover_G5401201005_ee4d3c877d92409181470449b458c189.pdf | Cover | 3 MB | Adobe PDF | View/Open |
fulltext_G5401201005_7702040424fc4c09a2e417f4f71ed26c.pdf Restricted Access | Fulltext | 3.87 MB | Adobe PDF | View/Open |
lampiran_G5401201005_b540d69229f04954b5644d03a85f3985.pdf Restricted Access | Lampiran | 2.03 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.