No abstract

This research aims to improve energy sustainability in transportation management. The case was derived from port-to-port coal transportation problem commonly faced by third-party logistic (3PL) company. During planning, they must determine which shipsets to be used and assign them to the loading/unloading berths. Each berth varies in terms of its loading/unloading speed and each shipset varies in terms of its capacity, sail speed, and fuel consumption rate. The selection of shipset impacts the auxiliary and main engine fuel consumption while the selection of berth impacts only the auxiliary engine fuel consumption. The target is to minimize the total fuel consumed by both engines for the whole shipset. We modelled the case through Multiple Vehicle Allocation Problem (MVAP) framework and proposed a heuristic algorithm to find the solutions. The heuristic algorithm is proven to be able to reach an optimal solution for small cases and near-optimal for medium to large cases.

Kegiatan order picking mengkonsumsi hampir 60% dari total ongkos gudang. Faktor utama yang membuat hal ini terjadi adalah jarak perpindahan saat order picking dilakukan. Penelitian ini mengambil satu kasus khusus dimana tata letak gudang merupakan two-cross aisle. Untuk menemukan rute order picking dengan jarak perpindahan terpendek, lima algoritma heuristik diterapkan dan dievaluasi berdasarkan jarak perpindahan yang diberikannya. Hasil dari penelitian ini menunjukkan peningkatan efisiensi gudang melalui penurunan jarak perpindahan selama melakukan order picking.   Kata kunci: algoritma heuristik, order picking, minimasi jarak perpindahan,