Optimasi Penjadwalan Sandar Kapal Di Pelabuhan Tanjung Perak Dengan Constructive Heuristics Dan Lovebird Algorithm: Studi Kasus Terminal Jamrud

Retnanik, Dwi Indah (2026) Optimasi Penjadwalan Sandar Kapal Di Pelabuhan Tanjung Perak Dengan Constructive Heuristics Dan Lovebird Algorithm: Studi Kasus Terminal Jamrud. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5026221034-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (4MB) | Request a copy

Abstract

Indonesia merupakan negara maritim sekaligus negara kepulauan, sehingga menjadikan transportasi laut memegang peran penting dalam konektivitas antar wilayah. Selain itu, transportasi laut juga berperan dalam ekonomi nasional suatu negara. Pentingnya peran tersebut perlu didukung dengan adanya prasarana berupa pelabuhan. Pelabuhan Tanjung Perak merupakan salah satu pelabuhan tersibuk di Jawa Timur dan memiliki peran penting, terutama melalui layanan di Terminal Jamrud. Seiring dengan meningkatnya trafik, aktivitas bongkar muat di Terminal Jamrud semakin padat, sehingga pengelolaan operasionalnya harus optimal. Di samping itu, keterbatasan jumlah dermaga, perbedaan karakteristik setiap kapal, dan kondisi cuaca mengakibatkan proses operasional pelabuhan semakin kompleks. Kondisi ini sering menimbulkan antrean kapal yang menunggu giliran untuk sandar semakin menumpuk sehingga mengakibatkan lamanya waiting time apabila tidak dikelola dengan baik. Penelitian ini mengusulkan penjadwalan sandar kapal untuk mengurangi total waiting time dengan menggunakan Constructive Heuristics dan Love Bird Algorihm. Hasil Constructive Heuristics digunakan sebagai solusi awal, kemudian dieksplorasi dan dieksploitasi secara iteratif melalui operator mutasi dan local search pada Lovebird Algorithm. Hasil pengujian menunjukkan bahwa penjadwalan dengan skenario single berthing memiliki kinerja yang lebih baik dibandingkan skenario re-berthing pada sebagian besar dataset berdasarkan total waiting time yang dihasilkan. Meskipun demikian, skenario re-berthing tetap berpotensi memberikan manfaat ketika kondisi dermaga sedang padat. Selain itu, metode yang diusulkan mampu menurunkan total waiting time dari 421,6 – 484,2 jam menjadi 13,6 – 31,9 jam, sedangkan rata-rata waiting time juga berkurang dari sekitar 7,3 - 7,9 jam menjadi 0,3 - 0,8 jam. Di samping itu, jumlah kapal yang memiliki durasi waiting time melebihi batas standar pelayanan menurun dari 38 - 47 kapal menjadi 3 - 5 kapal. Hasil tersebut menunjukkan bahwa metode yang diusulkan mampu menghasilkan penjadwalan sandar yang lebih efisien dan optimal dibandingkan kondisi operasional eksisting di Terminal Jamrud.
===================================================================================================================================
Indonesia is both a maritime and an archipelagic nation, making maritime transportation a vital component of interregional connectivity. Furthermore, maritime transportation plays a key role in a country’s national economy. The importance of this role must be supported by port infrastructure. Tanjung Perak Port is one of the busiest ports in East Java and plays a crucial role, particularly through the services provided at the Jamrud Terminal. As traffic increases, loading and unloading activities at the Jamrud Terminal have become increasingly intense, necessitating optimal operational management. Furthermore, the limited number of berths, the varying characteristics of each vessel, and weather conditions have made port operations increasingly complex. These conditions often lead to growing queues of ships waiting for their turn to berth, resulting in prolonged waiting times if not managed properly. This study proposes a ship berthing schedule to reduce total waiting time using Constructive Heuristics and the Lovebird Algorithm. The results of the Constructive Heuristics are used as an initial solution, which is then iteratively explored and exploited through mutation operators and local search in the Lovebird Algorithm. The test results show that scheduling using the single-berthing scenario performs better than the re-berthing scenario on most datasets, based on the total waiting time generated. Nevertheless, the re-berthing scenario still has the potential to provide benefits when the pier is congested. Furthermore, the proposed method reduces total waiting time from 421,6 – 484,2 hours to 13,6 – 31,9 hours, while the average waiting time also decreases from approximately 7.3 - 7.9 hours to 0.3 - 0.8 hours. Furthermore, the number of ships with waiting times exceeding the standard service limit decreased from 38 - 47 ships to 3 - 5 ships. These results indicate that the proposed method can produce a more efficient and optimal berthing schedule compared to the existing operational conditions at Jamrud Terminal.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Algoritma Lovebird, Berth Allocation Problem, Constructive Heuristics, Optimasi, Penjadwalan Sandar Kapal, Lovebird Algorithm, Berth Allocation Problem, Constructive Heuristics, Optimization, Ship Berthing Scheduling.
Subjects:	Q Science > QA Mathematics > QA401 Mathematical models. T Technology > T Technology (General) > T57.84 Heuristic algorithms.
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Information System > 57201-(S1) Undergraduate Thesis
Depositing User:	Dwi Indah Retnanik
Date Deposited:	21 Jul 2026 03:52
Last Modified:	21 Jul 2026 03:52
URI:	http://repository.its.ac.id/id/eprint/135614

Actions (login required)

View Item