Claim Missing Document
Check
Articles

Found 4 Documents
Search

Model Optimasi Model Optimasi Rute Transportasi Berbasis Pemrograman Linear Nazry, Hevlie Winda Nazry S; Ferdy Riza; Firahmi Rizky; Zuli Agustina Gultom; Muhammad Haris; Mika Debora Br Barus
Jurnal Sistem Informasi Triguna Dharma (JURSI TGD) Vol. 4 No. 1 (2025): EDISI JANUARI 2025
Publisher : STMIK Triguna Dharma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53513/jursi.v4i1.10586

Abstract

Transportasi merupakan salah satu elemen penting dalam mendukung aktivitas logistik dan distribusi. Efisiensi dalam perencanaan rute transportasi dapat mengurangi biaya operasional, waktu tempuh, serta dampak lingkungan. Penelitian ini bertujuan untuk mengembangkan model optimasi rute transportasi berbasis pemrograman linear yang mampu memberikan solusi optimal dalam penentuan rute. Model ini mempertimbangkan berbagai parameter, seperti jarak, waktu, kapasitas kendaraan, dan batasan operasional. Pendekatan pemrograman linear untuk menemukan solusi optimal terkait penentuan rute pengiriman yang efisien, dengan memperhatikan berbagai kendala seperti kapasitas kendaraan, permintaan pelanggan, dan waktu pengiriman. Model ini terdiri dari fungsi objektif yang meminimalkan total biaya transportasi, sementara kendala yang diterapkan meliputi batasan kapasitas kendaraan, pemenuhan permintaan pelanggan, dan batasan waktu perjalanan. Hasil penelitian menunjukkan bahwa penerapan model ini berhasil menghasilkan solusi yang optimal, dengan mengurangi biaya total pengiriman secara signifikan, sekaligus memenuhi semua persyaratan dan batasan yang ada. Model ini memberikan kontribusi dalam peningkatan efisiensi pengelolaan rute transportasi dan dapat diadaptasi untuk berbagai jenis sistem distribusi yang lebih kompleks
Utilization of Quantum Computing for Solving Advanced Mathematical Problems Hevlie Winda Nazry S; Firahmi Rizky; Ferdy Riza; Mika Debora Br Barus; Amin Harahap
International Journal of Health Engineering and Technology Vol. 3 No. 5 (2025): IJHET JANUARY 2025
Publisher : CV. AFDIFAL MAJU BERKAH

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55227/ijhet.v3i5.248

Abstract

his study explores the application of quantum computing in solving complex mathematical problems through the utilization of Grover's Algorithm. Grover's Algorithm, renowned for its efficiency in unstructured search, has been adapted for various mathematical applications requiring rapid solution searches within large solution spaces. In this study, we implement Grover's Algorithm on a quantum computing platform to address a range of complex mathematical problems, including nonlinear equations and combinatorial optimization. Experimental results demonstrate that Grover's Algorithm significantly reduces computational time compared to classical methods, highlighting the immense potential of quantum computing in advanced mathematics. These findings pave the way for the development of more sophisticated quantum algorithms and their applications across science, engineering, and technology domains.
Penerapan Algoritma K-Nearest Neighbors (K-NN) dan Naïve Bayes untuk Menentukan Pemilihan Penerima Bantuan Sosial Berdasarkan Ekonomi Masyarakat Dinda Amelia; Ferdy Riza
Jurnal Sistem Informasi dan Ilmu Komputer Vol. 3 No. 3 (2025): Agustus : Jurnal Sistem Informasi dan Ilmu Komputer
Publisher : Lembaga Pengembangan Kinerja Dosen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59581/jusiik-widyakarya.v3i3.5646

Abstract

One approach the government employs to decorate public welfare, mainly among low-income families, is through social help initiatives. however, the subjectivity inside the choice process regularly ends in mistargeting all through implementation. This observe objectives to apply the ok-Nearest Neighbor (ok-NN) and Naive Bayes algorithms inside a decision support device to perceive eligible recipients based on community statistics. The ok-NN algorithm determines similarity by calculating the Euclidean distance among new and current facts, whilst the Naive Bayes set of rules utilizes a probabilistic method based at the likelihood of attribute incidence inside each elegance. Key criteria considered consist of household income, employment kind, number of dependents, housing conditions, and asset possession. Experimental consequences reveal that each algorithms are powerful in as it should be classifying eligibility for help, with k-NN barely outperforming Naive Bayes. therefore, the combination of these algorithms can support stakeholders in making extra goal and efficient selections regarding the distribution of social useful resource.
Perancangan Absensi Dosen Berbasis IoT Memanfaatkan Rfid Tri Martati Harahap; Ferdy Riza
Al-DYAS Vol 4 No 1 (2025): Al-DYAS: Jurnal Inovasi dan Pengabdian kepada Masyarakat
Publisher : Lembaga Yasin AlSys

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58578/aldyas.v4i1.4073

Abstract

Attendance is an important element in the lecture system, but it is usually still done manually using attendance books and lists. This manual method is often inefficient in monitoring teacher discipline in terms of attendance and return time. To solve this problem, technologies such as Internet of Things (IoT) and radio frequency identification (RFID) offer a more efficient and accurate solution. IoT allows physical objects to connect to the internet for data exchange, and RFID can be used for automatic identification. This research aims to design an IoT-based lecturer attendance system using RFID and first-in-first-out (FIFO) algorithms. This system is expected to improve the accuracy and efficiency of the instructor attendance process and replace the existing manual method.