Claim Missing Document
Check
Articles

Found 2 Documents
Search

Penerapan Algoritma Dijkstra pada Pencarian Rute Terpendek ke Puskesmas Denpasar Utara II Arimbawa K, Ida Bagus Kade Puja; Permana, Putu Nanda Andika
Digital Transformation Technology Vol. 5 No. 2 (2025): Periode September 2025
Publisher : Information Technology and Science(ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/digitech.v5i2.7043

Abstract

Dalam beberapa tahun terakhir, angka kecelakaan lalu lintas mengalami peningkatan yang cukup signifikan di berbagai daerah, termasuk kawasan Denpasar. Banyaknya kasus kecelakaan yang terjadi tidak hanya menimbulkan kerugian matefriil, tetapi juga berdampak serius terhadap keselamatan jiwa masyarakat. Salah satu tantangan terbesar yang dihadapi adalah sulitnya menemukan rute tercepat untuk membawa korban ke fasilitas kesehatan terdekat, terutama dalam kondisi darurat. Penelitian ini berfokus pada penerapan algoritma Dijkstra untuk membantu menentukan rute tercepat menuju Puskesmas Denpasar Utara II dari berbagai titik lokasi di sekitarnya dalam radius tertentu. Dengan memanfaatkan algoritma ini, proses pencarian jalur tercepat menjadi lebih efisien dan terarah, sehingga dapat mempermudah masyarakat serta tenaga medis dalam memberikan pertolongan pertama dengan lebih cepat dan tepat. Penelitian ini bertujuan untuk menerapkan algoritma Dijkstra dalam menentukan rute tercepat menuju Puskesmas Denpasar Utara II dan memudahkan tenaga medis dalam membawa pasien darurat. Hasil penelitian meunjukkan bahwa algoritma ini mmpu memberikan rute optimal dengan jarak tempuh paling singkat dan efisiensi waktu yang tinggi.
Application of Ant Colony Optimization on CVRP for Waste Collection Route Optimization in Marga Village Arimbawa K, Ida Bagus Kade Puja; Novitasari, I Gusti Ayu; Permana, Putu Nanda Andika
Brilliance: Research of Artificial Intelligence Vol. 5 No. 2 (2025): Brilliance: Research of Artificial Intelligence, Article Research November 2025
Publisher : Yayasan Cita Cendekiawan Al Khwarizmi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/brilliance.v5i2.7006

Abstract

Marga Village, located in Marga District, Tabanan Regency, faces significant challenges in waste management due to the absence of a structured schedule and route for waste collection, leading to inefficiencies, high operational costs, infrastructure risks, and public health concerns. These issues are further exacerbated by population growth and spatial expansion, which continually increase waste volume. This study aims to optimize waste collection routes in Marga Village by applying the Capacitated Vehicle Routing Problem (CVRP) approach using the Ant Colony Optimization (ACO) algorithm to identify the most efficient and sustainable shortest route. The simulation considered two main constraints: a maximum vehicle capacity of 1.2 m³ and an average waste volume per point ranging from 0.04 to 0.2 m³, ensuring load feasibility. The model was tested with 10 ants over 10 iterations, with temporary disposal points located at a? (Banjar Lebah) and c? (Banjar Beng) before transportation to TPS3R. Algorithm parameters were set at ? = 1.0 for pheromone influence and ? = 5.0 for visibility, while the pheromone evaporation rate (?) was set to 0.5 and Q = 100 was used to reinforce optimal paths. The results demonstrate that ACO can effectively solve CVRP in waste collection, offering a data-driven solution to improve route efficiency and support sustainable urban waste management planning.