Claim Missing Document
Check
Articles

Found 3 Documents
Search

ANALISIS RANTAI PASOK DAN MEKANISME IMPOR BERAS DALAM MENJAGA STABILITAS HARGA DI INDONESIA Veronica, Veronica; Koto, Siti Khadijah; Efendi, Ade Irfan; Suryandari, Mega
Fruitset Sains : Jurnal Pertanian Agroteknologi Vol. 12 No. 6 (2025): February: Ilmu Pertanian dan Bidang Terkait
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/fruitset.v12i6.6129

Abstract

In January 2024, there was a rice deficit of 2.8 million tons, while rice production in 2023 reached 53.63 million tons of dry milled grain (GKG), down 2.05% from the previous year. The main problem in the supply chain is the role of middlemen who buy rice at low prices and sell it at high prices to traders and consumers. Perum BULOG is advised to buy directly from farmers to overcome this problem. In addition, the supply chain of imported rice involves eight complex stages. The government needs to regulate imports based on the production deficit and increase production through cooperation with the National Research and Innovation Agency (BRIN). The use of 4.0 technology in distribution, such as resource planning and warehouse management systems, is also recommended. However, challenges such as the limited digital infrastructure in remote areas and the lack of farmers' understanding of digital agriculture require special attention. Therefore, government policies must focus on technology procurement, improving human resource competence, simplifying bureaucracy, engaging the private sector, monitoring cartel practices, and mitigating external risks. This comprehensive approach is expected to strengthen food security and ensure rice price stability throughout Indonesia.
Determination of the Shortest Route with the Djikstra Algortima in the Operation of Aplousing and Maintenance of Shipping Navigation Aids (SBNP) Wanadi, M Adil Wanadi; Kusuma, Wisnu Wardana; Efendi, Ade Irfan; Rizal, Yus; Prakosa, Dandun
Maritime Park: Journal of Maritime Technology and Society Volume 5, Issue 1, 2026
Publisher : Department of Ocean Engineering, Faculty of Engineering, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62012/mp.vi.46426

Abstract

This study aims to implement the djikstra algorithm to overcome the problem of optimizing the shortest route determination in aplousing and maintenance activities of Shipping Navigation Assistance Facilities (SBNP) in the working area of the Tanjung Perak Type A Navigation District Office. The Navigation Pier has historically been a strategic facility to face the challenges of maintaining fuel efficiency, sailing times and reducing emissions in environmental pollution due to suboptimal routes. The djikstra algorithm is known to be effective in finding the shortest route on a weighted graph by representing strategic location points such as ports and marine navigation areas as nodes and the distance between nodes is calculated using the haversine formula based on geographic coordinates as weights. Before the implementation of travel route optimization, a total mileage of 1,210.30 km was obtained and after the optimization was applied using the djikstra algorithm, a total mileage of 1,110.44 km was obtained. This comparison shows a significant distance savings of 99.86 km or 8.25% travel efficiency. This optimization is able to contribute to time reduction, fuel savings and reduction of environmental pollution exhaust gas emissions so that it is able to optimize the operational effectiveness of ships as a whole. This study confirms the positive and relevant capabilities to be applied in shipping navigation route planning and support decision-making in the management of sea routes or logistics transportation in areas with a varied distribution of mileage points that require high efficiency and mobility. In the next research, it is hoped that it will be able to add external factors such as sea currents, waves, and wind according to the geographical characteristics of the territorial waters so that the results of route planning can be more accurate in the real operational area in the shipping work area.
Implementasi Algoritma Traveling Salesman Problem (TSP) dalam Penentuan Jalur Terpendek pada Rute Berlayar untuk Kegiatan Aplousing dan Perawatan SBNP di Wilayah Kerja Kantor Distrik Navigasi Tipe A Tanjung Perak: Penerapan Model TSP dalam Efisiensi Operasional Maritim EFENDI, ADE IRFAN
Jurnal Teknologi Sistem Informasi dan Aplikasi Vol. 8 No. 4 (2025): Jurnal Teknologi Sistem Informasi dan Aplikasi
Publisher : Program Studi Teknik Informatika Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/jtsi.v8i4.50429

Abstract

This study aims to optimize routes to improve fuel efficiency and voyage time, as well as reduce environmental pollution from state ship operations in Aplousing and Navigation Aid Maintenance (SBNP) activities in the working area of the Tanjung Perak Type A Class I Navigation District. To achieve this objective, the Traveling Salesman Problem (TSP) algorithm was applied to determine the shortest route connecting 11 port locations and islands in the waters of East Java. Two algorithmic approaches proposed in this study are the Heuristic Nearest Neighbor and Brute Force methods. Simulation results show that the Brute Force approach produces the most optimal route with a total distance of ± 1,095.94 km, which is more efficient than the Heuristic Nearest Neighbor approach at ± 1,110.33 km and the initial route without optimization at ± 1,284. The reduction in distance traveled has a positive impact on reducing fuel consumption, sailing time, and exhaust emissions. This study demonstrates that the application of the TSP algorithm can improve operational efficiency in shipping and can serve as a foundation for developing technology-based decision support systems for more environmentally friendly shipping route management.