Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri

Optimizing Ship Berthing Allocation Strategies at a Dry Bulk Fertilizer Terminal: A Simulation Approach Considering Material Handling Equipment Availability Putri, Maulin Masyito; Meilanitasari, Prita; Prasodjo, Nindya Putri; Arumjani, Dwi Sekar
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 27 No. 1 (2025): June 2025
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.27.1.77-92

Abstract

Long loading and unloading times at ports lead to demurrage costs, which occur when these activities exceed the agreed time. Demurrage is a penalty paid by shippers or charters to ship owners for delays. These delays can be caused by factors such as a lack of available docks or unprepared material handling equipment. This study examines dry bulk ports, focusing on four types of material handling, each with distinct characteristics and functions: the Continuous Ship Unloader (CSU) and Kangaroo Crane (KC) for unloading, and the Vessel Crane Flat Truck (VCFT), New Ship Unloader (NSL), and Vessel Crane with Dump Truck (VCDT) for loading. The CSU is the primary equipment for unloading, while the NSL is prioritized for loading bulk cargo. The variety of equipment and cargo adds complexity, best addressed through a discrete simulation approach. The study aims to identify the optimal berth allocation scenario, reducing loading and unloading times, waiting times, and demurrage costs using a discrete event simulation approach. Improvement scenario 2, which assigns berths based on the material being handled, resulted in a 33.49% increase in unloading revenue, a 1.81% increase in loading revenue, and a 13.54% reduction in demurrage costs.
Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns Meilanitasari, Prita; Putri, Maulin Masyito; Agustin, Ilda Auly Sita; Ibrahim, Muhammad Faisal; Arumjani, Dwi Sekar
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 27 No. 1 (2025): June 2025
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.27.1.93-104

Abstract

Online food delivery (OFD) businesses face several challenges, including the need for fast deliveries, a high volume of orders, and effective route planning to optimize service efficiency. This study employs the Meal Delivery Routing Problem (MDRP) algorithm to address issues related to courier assignment and capacity management in food delivery operations. The research focuses on scenarios involving a single courier, a single merchant, and multiple demand nodes. Two main methods were used in the study: (1) The Maximum Covering Model (MCM) algorithm, which identifies the coverage area of the courier, and (2) The Flexible Meal Delivery Assignment and Routing Problem (FMD-ARP) algorithm, which tackles routing challenges. Various scenarios were tested to validate the model based on the chosen routes. The aim of this research is to develop a new model and algorithm that reduces delivery time and increases the number of orders that couriers can handle. After processing and analyzing the numerical data, the study identified the most effective scenario that led to improved delivery times and benefits for couriers, enabling them to manage more orders and achieve faster delivery compared to existing algorithms.