Optimasi Rute Truk Untuk Penyiraman Taman Pasif di Kota Surabaya Menggunakan Algoritma Discrete Firefly Algorithm

Rachman, Dinanti Vita (2026) Optimasi Rute Truk Untuk Penyiraman Taman Pasif di Kota Surabaya Menggunakan Algoritma Discrete Firefly Algorithm. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5026221190-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (11MB) | Request a copy

Abstract

Ruang terbuka hijau (RTH) menjadi elemen penting dalam tata ruang kota karena berfungsi menjaga keseimbangan ekosistem, mengatur iklim mikro, menyerap karbon, serta menyediakan ruang interaksi sosial bagi masyarakat. Taman pasif merupakan salah satu bentuk RTH di Kota Surabaya yang memerlukan penyiraman rutin menggunakan truk tangki air. Permasalahan yang dihadapi adalah penentuan rute truk yang belum optimal sehingga menyebabkan overtime pada tiap shift akibat keterbatasan kendaraan dan kebutuhan air yang berbeda-beda di setiap taman. Tugas akhir ini mengembangkan model optimasi rute penyiraman menggunakan Multi-Depot Split Delivery Vehicle Routing Problem with Time Windows (MD-SDVRPTW) dengan algoritma Discrete Firefly Algorithm (DFA) yang dipadukan local search untuk menyeimbangkan beban kerja dan meminimalkan waktu tempuh, pada studi kasus Rayon Timur dan Rayon Pusat Kota Surabaya. Proses optimasi memanfaatkan Open Source Routing Machine (OSRM) untuk memperoleh matriks jarak dan waktu tempuh berdasarkan jaringan jalan aktual, sedangkan rute optimal yang dihasilkan divisualisasikan dalam bentuk peta interaktif menggunakan pustaka Folium untuk mempermudah analisis dan interpretasi. Data yang digunakan meliputi lokasi taman, titik pengambilan air, kapasitas truk, jam operasional, serta luas dan kebutuhan air tiap taman. Hasil optimasi menunjukkan DFA menghasilkan solusi lebih baik dibandingkan Genetic Algorithm (GA), dengan penurunan total jarak tempuh 19,40%–28,73% (Rayon Timur) dan 10,29%–18,48% (Rayon Pusat), serta penurunan waktu operasional 11,21%–13,45% dan 1,58%–13,26%. Hasil ini telah divalidasi oleh pihak DKRTH Kota Surabaya dan dinilai realistis untuk diterapkan.
=====================================================================================================================================
Green open spaces are an important element in urban spatial planning, helping maintain ecosystem balance, regulate microclimate, absorb carbon, and provide social interaction spaces for the community. Passive parks are one form of green open space in Surabaya requiring routine watering using water tanker trucks. The problem faced is suboptimal truck routing, causing overtime in each shift due to limited vehicles and varying water demand across parks. This final project develops a watering route optimization model using the Multi-Depot Split Delivery Vehicle Routing Problem with Time Windows (MD-SDVRPTW), applying the Discrete Firefly Algorithm (DFA) combined with local search to balance workload and minimize travel time, for the case study of the Eastern and Central Districts of Surabaya. The optimization process utilizes the Open Source Routing Machine (OSRM) to obtain distance and travel-time matrices based on the actual road network, while the resulting optimal routes are visualized as interactive maps using the Folium library to support analysis and interpretation. The data used include park locations, water intake points, truck capacities, operational hours, and each park's area and water demand. Results show DFA produces better solutions than the Genetic Algorithm (GA), reducing total travel distance by 19.40%–28.73% (Eastern District) and 10.29%–18.48% (Central District), with operational time reductions of 11.21%–13.45% and 1.58%–13.26%. These results have been validated by DKRTH Surabaya City and considered realistic for implementation.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Discrete Firefly Algortihm, Multiple-Depot Split Delivery Vehicle Routing Problem with Time Windows, Optimasi Rute, Ruang Terbuka Hijau, Discrete Firefly Algorithm, Multiple-Depot Split Delivery Vehicle Routing Problem with Time Windows, Route Optimization, Green Open Space
Subjects:	H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice T Technology > T Technology (General) > T57.6 Operations research--Mathematics. Goal programming
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Information System > 57201-(S1) Undergraduate Thesis
Depositing User:	Dinanti Vita Rachman
Date Deposited:	28 Jul 2026 08:26
Last Modified:	28 Jul 2026 08:26
URI:	http://repository.its.ac.id/id/eprint/138561

Actions (login required)

View Item