RANCANG BANGUN APLIKASI PENJADWALAN TAMBAT KAPAL PADA PT BERLIAN JASA TERMINAL INDONESIA (PT BJTI) SURABAYA DENGAN MENGGUNAKAN METODE TABU SEARCH
Abstract: PT Berlian Jasa
Terminal Indonesia (PT BJTI) is a subsidiary of PT Pelabuhan Indonesia III (PELINDO
III). One of the services of PT BJTI is operate the dock of berlian for a
vessel. Schedulingprocess conducted by PT BERLIAN JASA TERMINAL INDONESIA ( PT
BJTI) have some problem that sometimes raises during the berthing process,
because the use of the area slot for the berthing process is not optimal. The
purpose of word is not optimal mean that there are too wide distance between
the ship, causing many empty dock area at the time of scheduling berthing
vessel. This problem will affect the mount of the vessel that can be berth.
To solve this problem, we need a berth vessel scheduling application to
optimize the using of berth area. Therefore, in this case study, we built berth
vessel scheduling applications. This application is built by implementing the
Tabu Search method.
Based on the result of the test case that have been done, it can be
concluded that the applications that have been built in this case study has
been able to optimize the using of berth area. This can be seen in the increase
amount of the space area around 31.36% after using the application of this
research. Additionally, time availability of berth area also increased by 8
hours up faster than before. From the the amount of the increase can be
concluded that the application of berth vessel scheduling with Tabu Search
method is able to optimize the use of berth area so as to maximize thenumber of
vessels mooring.
Keywords: Berth Scheduling,
Tabu Search, Berth Vessel, Berth Allocation Problem (BAP), Berth Scheudling
Problem (BSP)
Penulis: Mochamad Rifai Idris
Kode Jurnal: jptinformatikadd160817
