Article Per Year (5 Year)
p-Index From 2021 - 2026
3.096
P-Index
This Author published in this journals
All Journal Matematika: Jurnal Teori dan Terapan Journal of the Indonesian Mathematical Society CESS (Journal of Computer Engineering, System and Science) GOLDEN AGE: JURNAL PENDIDIKAN ANAK USIA DINI International Journal of Global Operations Research Jurnal Riset Matematika Bandung Conference Series: Mathematics Matematika
Respitawulan, R
Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Islam Bandung
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Mathematics Transportation Other

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

Found 24 Documents
Search

 1   2   3 
Sistem Pendukung Keputusan Penentuan Kenaikan Kelas Santri Menggunakan Metode TOPSIS Alma Arofah; Respitawulan
Jurnal Riset Matematika Volume 2, No. 2, Desember 2022, Jurnal Riset Matematika (JRM)
Publisher : UPT Publikasi Ilmiah Unisba

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29313/jrm.v2i2.1194

Abstract

Abstract. TOPSIS is one of the methods contained in the Multi Criteria Decision Making (MCDM). In general, this method works based on criteria which are the determining factors for a case study by assessing the weight of each criterion. The purpose of this study was to find the priority value of a case of determining the class increase of students at the Al-Falah Dago Islamic Boarding School. The TOPSIS method can make it easier for Islamic boarding schools to determine whether students will go to class or not go to class objectively with predetermined criteria. In the process of determining the class increase of the students of the Al-Falah Dago Islamic Boarding School, there are 42 alternatives with 6 criteria being assessed: the average value of imtihan 1, the average value of imtihan 2, attendance, practice values, discipline values and moral values. The results of this study indicate that the results obtained from the determination of grade promotion from 42 alternatives resulted in recommendations for 27 students to go to class and as many as 15 students not to go to class. Abstrak. TOPSIS merupakan salah satu metode yang terdapat pada Multi Criteria Decision Making (MCDM). Secara umum metode ini bekerja berdasarkan kriteria yang merupakan faktor penentu bagi suatu studi kasus dengan menilai bobot dari setiap kriteria. Tujuan dari penelitian ini adalah mencari nilai prioritas dari sebuah kasus penentuan kenaikan kelas santri Pondok Pesantren Al-Falah Dago. Metode TOPSIS dapat mempermudah pihak pesantren untuk menentukan santri naik kelas atau tidak naik kelas secara objektif dengan kriteria yang sudah ditentukan. Dalam proses penentuan kenaikan kelas santri Pondok Pesantren Al-Falah Dago terdapat 42 alternatif dengan 6 kriteria yang menjadi penilaian: nilai rata-rata imtihan 1, nilai rata-rata imtihan 2, kehadiran, nilai praktik, nilai kedisiplinan dan nilai akhlaq. Hasil penelitian ini menunjukkan bahwa perolehan hasil penentuan kenaikan kelas dari 42 alternatif dihasilkan rekomendasi sebanyak 27 santri naik kelas dan sebanyak 15 santri tidak naik kelas.
Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route Fargiana, Farid; Respitawulan, Respitawulan; Fajar, Yusuf; Suhaedi, Didi; Harahap, Erwin
International Journal of Global Operations Research Vol. 3 No. 2 (2022): International Journal of Global Operations Research (IJGOR), May 2022
Publisher : iora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47194/ijgor.v3i2.137

Abstract

The buying and selling transaction system that many people use today is the online buying and selling system. In this system, there is a process of goods delivery by one branch of a freight forwarder in Indonesia, namely SiCepat Express Baleendah. In the process of shipping goods, a delivery route with the shortest path is needed in order to minimize of the goods delivery process. The problem of the route of goods delivery can be solved by one of the algorithms in the Traveling Salesman Problem (TSP), namely the Cheapest Insertion Heuristic (CIH) Algorithm. This study aims to determine the shortest route and distance for goods delivery using the CIH Algorithm by the Asymmetric TSP CIH application, as well as knowing its efficiency compared to the route that used by SiCepat Express Baleendah. The result shows that the use of the CIH Algorithm is proven to produce a more efficient delivery route than the route created by SiCepat Express Baleendah. Based on the goods delivery route from SiCepat Express Baleendah, the result of the total distance is 18.55 km. On the other hand, based on the CIH Algorithm, the delivery route obtained result is 13.45 km. The efficiency of using the CIH Algorithm is 27.48% better than the result from SiCepat Express Baleendah route.
On The Adjoint of Bounded Operators On A Semi-Inner Product Space Respitawulan, R.; Pangestu, Qori Y.; Kusniyanti, Elvira; Yuliawan, Fajar; Astuti, Pudji
Journal of the Indonesian Mathematical Society VOLUME 29 NUMBER 3 (NOVEMBER 2023)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.29.3.1598.311-321

Abstract

The notion of semi-inner product (SIP) spaces is a generalization of inner product (IP) spaces notion by reducing the positive definite property of the product to positive semi-definite. As in IP spaces, the existence of an adjoint of a linear operator on a SIP space is guaranteed when the operator is bounded. However, in contrast, a bounded linear operator on SIP space can have more than one adjoint linear operators. In this article we give an alternative proof of those results using the generalized Riesz Representation Theorem in SIP space. Further, the description of all adjoint operators of a bounded linear operator in SIP space is identified.
Perbandingan Algoritma Dijkstra dan Bellman Ford dalam Menentukan Rute Terpendek Cafe Hopping Gheamelia, Dieva; Respitawulan, R; Permanasari, Yurika
Jurnal Riset Matematika Volume 5, No.2, Desember 2025, Jurnal Riset Matematika (JRM)
Publisher : UPT Publikasi Ilmiah Unisba

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29313/jrm.v5i2.8297

Abstract

Abstrak. Penelitian ini bertujuan untuk membandingkan dua algoritma pencarian rute terpendek, yaitu Dijkstra dan Bellman-Ford, dalam konteks kegiatan cafe hopping di Kota Bandung. Dengan semakin maraknya minat masyarakat terhadap eksplorasi tempat-tempat kuliner seperti cafe, dibutuhkan sistem yang mampu memberikan rute tercepat dan terpendek agar kegiatan tersebut lebih efisien. Penelitian dilakukan dengan membangun model graf berarah berbobot dari beberapa lokasi cafe populer, menggunakan jarak antar titik sebagai bobot sisi. Implementasi algoritma dilakukan menggunakan Python di Google Colab. Hasil pengujian menunjukkan bahwa meskipun kedua algoritma menghasilkan rute dan jarak yang sama dari titik awal ke tujuan akhir, Algoritma Dijkstra memproses data lebih cepat karena tidak melakukan relaksasi berulang seperti Bellman-Ford. Namun, Bellman-Ford memiliki keunggulan dalam menangani graf dengan bobot negatif. Penelitian ini menyimpulkan bahwa pemilihan algoritma harus disesuaikan dengan karakteristik graf dan kebutuhan aplikasi. Rekomendasi untuk pengembangan selanjutnya mencakup penggunaan graf dua arah dan integrasi data waktu tempuh aktual agar solusi lebih relevan terhadap kondisi nyata di lapangan. Abstract. This study aims to compare two shortest path algorithms, namely Dijkstra and Bellman-Ford, in the context of cafe hopping activities in Bandung City. With the growing public interest in exploring culinary destinations such as cafés, a system that can determine the most efficient and shortest route is essential. The research was conducted by modeling a directed weighted graph based on several popular cafe locations, using the distance between each point as edge weights. The algorithms were implemented using Python on the Google Colab platform. The results show that although both algorithms produced the same route and distance from the starting point to the destination, Dijkstra's algorithm processed the data faster due to its single-pass nature, unlike Bellman-Ford which performs multiple relaxation steps. However, Bellman-Ford has the advantage of handling graphs with negative weights. This study concludes that the selection of an algorithm should align with the graph characteristics and application needs. Future development is recommended to include bidirectional graphs and real-time travel time data to ensure more practical and realistic solutions in real-world scenarios. 
Co-Authors Alfi Fadilla Hanum Alma Arofah Andika Tresnasena Arlinda Astri Frianti Azka Azkiyatul Mahmudah Didi Suhaedi Ervita Shera Pratiwi Erwin Harahap Fadly Andika Fajar Ilham Maulana Fajar Yuliawan Fajar, Yusuf Fakhri Murfid Pratama Pratama Fargiana, Farid Gani Gunawan Gheamelia, Dieva Hilda Chaerunnissa I. Irmawati Icih Sukarsih Jumidah Kusniyanti, Elvira Onoy Rohaeni Pangestu, Qori Y. PUDJI ASTUTI Qirana Azmil Zamhur Rafly Anugerah Sultan Chaeruddin Syarif Mawardi Dwi Putra Wilda Ismarnita Yani Ramdani Yurika Permanasari