Berth scheduling by simulated annealing

The 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-l...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part B: methodological 2003-07, Vol.37 (6), p.541-560
Main Authors: Kim, Kap Hwan, Moon, Kyung Chan
Format: Article
Language:English
Subjects:
Applied sciences
Berth scheduling
Buildings. Public works
Container terminals
Exact sciences and technology
Ground, air and sea transportation, marine construction
Hydraulic constructions
Marine and water way transportation and traffic
Mixed-integer-programming
Port facilities and coastal structures. Lighthouses and beacons
Simulated annealing
Transportation planning, management and economics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The 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.
ISSN:0191-2615
1879-2367
DOI:10.1016/S0191-2615(02)00027-9