Claim Missing Document
Check
Articles

Found 13 Documents
Search

Determining the Shortest Route for Eid Homecoming Route Using the Haversine Formula Method and A Star Algorithm Nurpandi, Finsa; Syarifah Sany, Diny
Journal of Computer System and Informatics (JoSYC) Vol 6 No 3 (2025): May 2025
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v6i3.5911

Abstract

Eid homecoming, also known as "Mudik" in Indonesia, is an annual tradition that involves the mass movement of people from cities to their hometowns to celebrate the Eid al-Fitr holiday. Based on data from the Ministry of Transportation of the Republic of Indonesia, there are five major regions that serve as the primary destinations for homecoming travelers: West Java, Central Java, East Java, DI Yogyakarta, and the Jabodetabek region. The Central Java region is estimated to receive the largest number of homecoming travelers, with an estimated 61.6 million people. Given the potential for human movement of up to 193.6 million people during this period, it poses a significant traffic burden, and an efficient determination of the shortest route is crucial. To address this challenge, the study utilizes the Haversine Formula, which calculates the distance between two geographic points on the earth's surface by considering the curvature of the earth. This approach provides a more accurate distance estimate compared to traditional linear distance calculations. Additionally, the A* algorithm is employed to determine the shortest path from the starting point to the destination. The A* algorithm combines the distance calculation results from the Haversine Formula as a heuristic component in the search process, effectively optimizing the route selection. The results of the A* algorithm search identified the shortest route for homecoming travelers, which starts from the city of Jakarta, passes through West Karawang, Indramayu, Cirebon, Tegal, Pekalongan, Semarang, and Salatiga, before reaching the final destination of Klaten. This optimized route covers a total distance of 599.4 km, providing an efficient and cost-effective option for travelers during the Eid homecoming period
SISTEM REKOMENDASI TANAMAN EDIBLE DARI SAMPAH ORGANIK RUMAH TANGGA BERBASIS ANDROID MENGGUNAKAN COSINE SIMILARITY Sany, Diny Syarifah; Nurpandi, Finsa; Zikri, Fauzan
AGROSCIENCE (AGSCI) Vol 15, No 1 (2025): June
Publisher : Fakultas Sains Terapan, Universitas Suryakancana Cianjur

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35194/agsci.v15i1.5258

Abstract

Kemandirian pangan rumah tangga merupakan elemen penting dalam mewujudkan ketahanan pangan nasional yang berkelanjutan. Di sisi lain, sebagian besar rumah tangga di Indonesia menghasilkan sampah organik setiap hari namun belum dikelola secara optimal. Penelitian ini bertujuan mengembangkan ReKompos, sebuah sistem rekomendasi tanaman edible berbasis Android yang memanfaatkan kandungan unsur hara dari dua jenis sampah organik untuk merekomendasikan tanaman paling sesuai berdasarkan metode cosine similarity. Dataset terdiri dari 230 jenis sampah organik dengan atribut Nitrogen (N), Fosfor (P), Kalium (K), dan Kalsium (Ca), serta 69 tanaman edible dengan profil kebutuhan nutrisi masing-masing. Sistem menggabungkan dua vektor nutrisi sampah, kemudian menghitung tingkat kesamaan terhadap vektor kebutuhan tanaman untuk menentukan rekomendasi. Hasil pengujian menunjukkan bahwa sistem mampu memberikan rekomendasi tanaman secara proporsional dan sesuai secara agronomis, dengan nilai similarity tertinggi mencapai 0.96 (misalnya pada kombinasi Kulit Pisang dan Ampas Kopi terhadap tanaman Mentimun dan Terong). Implementasi sistem berjalan efisien di platform Android dan dapat digunakan secara offline. ReKompos berpotensi menjadi solusi berbasis teknologi yang mendukung pengelolaan sampah rumah tangga, pertanian pekarangan, dan konsumsi berkelanjutan.
Evaluation of Deflate Algorithm in Lossless Compression of Digital Document Formats Nawawi, Muhammad Irwan; Nurpandi, Finsa
Media Jurnal Informatika Vol 17, No 2 (2025): Media Jurnal Informatika
Publisher : Teknik Informatika Universitas Suryakancana Cianjur

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35194/mji.v17i2.5746

Abstract

As the volume of digital data continues to escalate across sectors such as education, business, and government, the demand for efficient data storage and transmission methods grows increasingly critical. Data compression algorithms offer a prevalent solution to this challenge. This study undertakes an evaluation of the Deflate algorithm's performance in compressing digital document files, specifically examining its efficacy in reducing file size and its efficiency in processing time. Employing a comparative analysis methodology, the research involves measuring file sizes before and after compression, recording compression and decompression durations on a machine with an Intel Core i5 CPU, 8 GB RAM, running Windows 10 64-bit, and calculating compression ratios. The implementation utilizes Python and the Zlib library, which directly supports the Deflate algorithm. Tests were conducted on diverse document types, including plain text files, mixed-content files, and files rich in visual elements like images. The findings indicate that the Deflate algorithm achieves a significant compression ratio, reducing file sizes by over 90% and reaching a maximum ratio of 99.60% for text files. Compression and decompression operations were most rapid for text files, averaging 0.01 seconds. However, for documents containing images, the compression ratio was considerably lower and less impactful. Notwithstanding this, the compression and decompression times remained relatively swift and consistent across all document types. These results underscore the importance of aligning compression algorithm selection with the specific content characteristics of a document to attain optimal efficiency.