Article Per Year (5 Year)
p-Index From 2020 - 2025
1.578
P-Index
This Author published in this journals
All Journal Jurnal Matematika E-Jurnal Matematika JUTIK : Jurnal Teknologi Informasi dan Komputer JURNAL PEMBELAJARAN DAN MATEMATIKA SIGMA (JPMS) DEDIKASI PKM Brilliance: Research of Artificial Intelligence Digital Transformation Technology (Digitech)
Ida Bagus Kade Puja Arimbawa K.
Universitas Bali Dwipa
Agriculture, Biological Sciences & Forestry Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Library & Information Science Mathematics Social Sciences Other

Published : 9 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 9 Documents
Search

 1 
KOMPARASI METODE ANFIS DAN FUZZY TIME SERIES KASUS PERAMALAN JUMLAH WISATAWAN AUSTRALIA KE BALI IDA BAGUS KADE PUJA ARIMBAWA K.; KETUT JAYANEGARA; I PUTU EKA NILA KENCANA
E-Jurnal Matematika Vol 2 No 2 (2013)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/MTK.2013.v02.i02.p033

Abstract

This study compares the accuracy of forecasting using ANFIS and Fuzzy Time Series the number of Australian tourists to Bali. The data used in this study are data on the number of Australia tourists visit to Bali from the period January 2006 through December 2011. ANFIS consists of two stages of learning and testing phases. Least Squares Estimator is used to study the forward direction and Error Back Propagation learning is used in the reverse direction. Forecasting with Fuzzy Time Series is forecast to capture the pattern of previous data is then used to project the data to come. The results of comparison of both methods showed that the ANFIS method has a higher forecasting accuracy than the method of Fuzzy Time Series. Forecasting by using ANFIS method obtained AFER aqual to 9,26% while the prediction using the method of Fuzzy Time Series obtained AFER aqual to 14,02%
PEWARNAAN GRAF WELCH-POWELL PADA PENYUSUNAN JADWAL PERKULIAHAN DI PROGRAM STUDI AKUNTANSI UNIVERSITAS BALI DWIPA Ida Bagus Kade Puja Arimbawa K; Ketut Queena Fredlina; Agung Sedayu
Jurnal Teknologi Informasi dan Komputer Vol. 9 No. 4 (2023): Jurnal Teknologi Informasi dan Komputer
Publisher : LPPM Universitas Dhyana Pura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36002/jutik.v9i4.2647

Abstract

Penyusunan jadwal di awal semester akademik menjadi kompleks karena sering kali terjadibentrok jadwal antar mata kuliah. Walaupun penyusunan jadwal secara individu tidaklah sulit,namun hal tersebut dapat menjadi rumit Ketika melibatkan banyak orang dengan kesibukan yangberbeda-beda. Untuk mengatasi permasalahan tersebut, salah satu solusinya adalah denganmenggunakan Teknik pewarnaan graf yang memanfaatkan algoritma Welch-Powell untukmendapat solusi yang optimal dalam penyusunan jadwal kuliah. Dengan demikian, permasalahanrutinitas di awal semester dapat diatasi dengan lebih efektif.
Optimization of the Shortest Tsunami Evacuation Route Using Djikstra’s Algorithm in Benoa Village Ida Bagus Kade Puja Arimbawa K; Wayan Sukartiasih; Agung Sedayu
Brilliance: Research of Artificial Intelligence Vol. 3 No. 2 (2023): Brilliance: Research of Artificial Intelligence, Article Research November 2023
Publisher : Yayasan Cita Cendekiawan Al Khwarizmi

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

Abstract

Benoa Village has an area of approximately 2.38 km² and a population of 9,569 people in 2020 with a population density of 4,013 people/km2. This area is included in the list of tsunami-prone areas because the area is located on the edge of the Indian Ocean, which is known as an area with a high level of earthquake and volcanic activity. The 2004 tsunami that hit the coast of the Indian Ocean increased the potential for similar disasters to occur in the area. Determination of the shortest evacuation route in Benoa Village using Djikstra Algorithm. The result obtained is a path from the evacuation starting point vertex to the comfort zone node. Thisvertex represents places and road intersections arranged in the form of a weighted graph (distance) with a total of 51 vertexs, and an Adjacency Matrix is formed which is processed using the C++ Program. The Safe Zone vertex (Grand Hyatt Bali Temporary Meet Point (V50), Hattrick Futsal (V51)) are headed from the evacuation starting point of Serangan Beach (4.49km to V50, 6.94km to V51), Noanui Beach (3.95km to V50, 6.39km to V51), Samuh Beach (2.75km to V50, 5, 19km to V51), Nusa Dua Beach A (3.54km to V50, 5.48km to V51), Nusa Dua Beach B (3.47km to V50, 4.79km to V51), Peninsula Island (4.69km to V50, 4.80km to V51), Megiat Beach (4.81km to V50, 4.15km to V51) and Geger Beach (5.86km to V50, 5.09km to V51).
Algoritma Djikstra : Rute Pengungsian Terpendek Daerah Rawan Bencana di Desa Canggu Arimbawa K., Ida Bagus Kade Puja
Jurnal Matematika Vol 14 No 1 (2024)
Publisher : Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JMAT.2024.v14.i01.p171

Abstract

Canggu Village, located in North Kuta, Badung Regency, Bali, Indonesia, is a popular tourist area with a population density of 1,305 people per square kilometer. This region offers an attractive combination of natural beauty, rich Balinese culture, and modern lifestyle, yet it also faces high risks of natural disasters such as floods, tsunamis, and coastal erosion due to its coastal location. The coastal geography of Canggu necessitates awareness and preparedness for disasters. This study focuses on formulating and implementing evacuation routes using the Dijkstra algorithm to find the shortest and safest evacuation path from disaster-prone areas to safe zones. The results indicate that the Dijkstra algorithm is effective in establishing evacuation routes from the most vulnerable points, such as Batu Bolong Beach, to safe zones with varying distances, allowing residents to leave high-risk areas quickly and safely. These recommendations are expected to be used by local governments in disaster planning and management.
Penerapan Lintasan Terpendek Untuk Evakuasi Darurat pada Bangunan Primakara University Fredlina, Ketut Queena; Arimbawa K., Ida Bagus Kade Puja
JURNAL PEMBELAJARAN DAN MATEMATIKA SIGMA (JPMS) Vol 10, No 2 (2024)
Publisher : Fakultas Keguruan dan Ilmu pendidikan (FKIP) Universitas Labuhan Batu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36987/jpms.v10i2.5884

Abstract

Penelitian ini mengkaji penerapan algoritma Floyd-Warshall untuk mengoptimalkan rute evakuasi darurat di Bangunan Primakara University. Dengan fokus pada peningkatan keamanan dan efisiensi evakuasi, penelitian ini menggunakan matriks ketetanggaan yang menggambarkan jarak antar ruangan dalam bangunan untuk mengidentifikasi jalur evakuasi terpendek menggunakan teori graf. Metodologi yang digunakan meliputi pengumpulan data ruang dan pengujian algoritma dalam simulasi C++ untuk menghitung rute evakuasi. Hasil penelitian menunjukkan bahwa dengan aplikasi algoritma Floyd-Warshall, dapat disusun rute evakuasi yang tidak hanya meminimalkan waktu evakuasi tetapi juga memastikan keselamatan maksimal penghuni dalam situasi darurat. Studi ini memberikan implikasi signifikan untuk perancangan sistem evakuasi yang lebih efektif di lingkungan universitas, menawarkan kerangka kerja yang dapat diadaptasi untuk situasi darurat lainnya.
Pelatihan Menuju Generasi Digital yang Paham Netiket di Desa Datah Karangasem Ketut Queena Fredlina; Ida Bagus Kade Puja Arimbawa K.
DEDIKASI PKM Vol. 5 No. 3 (2024): DEDIKASI PKM UNPAM
Publisher : Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/dkp.v5i3.41886

Abstract

Internet telah menjadi bagian integral dari kehidupan sehari-hari, termasuk di Desa Datah, Kabupaten Karangasem. Akses internet yang semakin luas memberikan peluang bagi masyarakat desa, terutama generasi muda, untuk terhubung dengan dunia luar dan berpartisipasi dalam berbagai kegiatan online. Namun, kurangnya pemahaman mengenai etika berinternet atau netiket dapat menyebabkan berbagai masalah seperti penyebaran informasi palsu dan cyberbullying. Program pengabdian "Pelatihan Menuju Generasi Digital Yang Paham Netiket Di Desa Datah Karangasem" bertujuan untuk memberikan edukasi mengenai pentingnya etika berinternet kepada masyarakat Desa Datah. Melalui pelatihan ini, diharapkan generasi muda dapat menjadi pengguna internet yang cerdas dan bertanggung jawab, sehingga tercipta lingkungan digital yang aman dan harmonis.
Ant Colony Optimization for Waste Collection Routing: A Case Study in Sekar Tunjung Residential Arimbawa K, Ida Bagus Kade Puja
Brilliance: Research of Artificial Intelligence Vol. 5 No. 1 (2025): Brilliance: Research of Artificial Intelligence, Article Research May 2025
Publisher : Yayasan Cita Cendekiawan Al Khwarizmi

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

Abstract

Waste collection is a critical issue in the management of efficient urban systems, particularly in densely populated residential areas. Inefficient waste transportation routes can lead to excessive fuel consumption, prolonged collection times, and increased operational costs. This study proposes the application of the Ant Colony Optimization (ACO) algorithm as a metaheuristic approach to solve the Capacitated Vehicle Routing Problem (CVRP) in the context of waste collection. ACO mimics the foraging behavior of ant colonies, allowing it to explore and reinforce optimal routing paths based on pheromone intensity and distance-based desirability. The methodology involves modeling a spatial network of waste pick-up points, each with varying waste volumes, and incorporating truck capacity constraints into the routing algorithm. The case study is situated in the Sekar Tunjung residential in East Denpasar, where the simulation uses ten pick-up points and a waste truck starting and ending at TPS3R Kesiman. Parameters such as pheromone influence , visibility , and evaporation rate  are tuned to find the best route configuration. Simulation results show that ACO efficiently constructs a single-trip route covering all points while respecting capacity limits. The algorithm demonstrates adaptability to changes in volume distribution and capacity scenarios, resulting in minimal total travel distance. This research confirms the potential of ACO as a robust and flexible solution for optimizing waste transportation logistics in urban environments.
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.
Co-Authors Agung Sedayu Agung Sedayu I Putu Eka Nila Kencana Ketut Jayanegara Ketut Queena Fredlina Ketut Queena Fredlina NOVITASARI, I GUSTI AYU Permana, Putu Nanda Andika Wayan Sukartiasih