AbstractThe objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.
Berth scheduling by simulated annealing
Transportation Research Part B: Methodological ; 37 , 6 ; 541-560
2002-03-28
20 pages
Article (Journal)
Electronic Resource
English
Berth scheduling by simulated annealing
Online Contents | 2003
|Discrete Berth-Scheduling Problem
Transportation Research Record | 2010
|Transportation Research Record | 2010
|Heuristics for quay crane scheduling at indented berth
Online Contents | 2011
|