You are here

Berth scheduling in container terminals

Download pdf | Full Screen View

Date Issued:
2013
Summary:
Ports and container terminals have very complex and dynamic operations. Effective and efficient berth schedules are essential for profitable and sustainable operations. This research studies berth scheduling under uncertainties in arrival and handling times. Port operators usually face challenges in the development of berth schedules. This thesis presents a model formulation of discrete berth space that accounts for uncertainty in arrival and handling times. The problem is reformulated as a biobjective bi-level optimization berth scheduling problem. A solution approach is presented using evolutionary algorithms and heuristics. The objective of the formulation is to provide a robust berth schedule by minimizing the average and the range of the total service times for all vessels served at the terminal. Simulation is utilized to evaluate the proposed berth scheduling policy and compare it to two first-come-first-served policies. Results showed that the proposed berth schedules outperform under high congestion.
Title: Berth scheduling in container terminals: a pro-active approach to address uncertainties in arrival and handling times.
54 views
6 downloads
Name(s): Portal Palomo, Maria I.
College of Engineering and Computer Science
Department of Ocean and Mechanical Engineering
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Date Issued: 2013
Publisher: Florida Atlantic University
Physical Form: electronic
Extent: xiv, 91 p. : ill. (some col.)
Language(s): English
Summary: Ports and container terminals have very complex and dynamic operations. Effective and efficient berth schedules are essential for profitable and sustainable operations. This research studies berth scheduling under uncertainties in arrival and handling times. Port operators usually face challenges in the development of berth schedules. This thesis presents a model formulation of discrete berth space that accounts for uncertainty in arrival and handling times. The problem is reformulated as a biobjective bi-level optimization berth scheduling problem. A solution approach is presented using evolutionary algorithms and heuristics. The objective of the formulation is to provide a robust berth schedule by minimizing the average and the range of the total service times for all vessels served at the terminal. Simulation is utilized to evaluate the proposed berth scheduling policy and compare it to two first-come-first-served policies. Results showed that the proposed berth schedules outperform under high congestion.
Identifier: 852252727 (oclc), 3360960 (digitool), FADT3360960 (IID), fau:4124 (fedora)
Note(s): by Maria Isabel Portal Palomo.
Vita.
Thesis (M.S.C.S.)--Florida Atlantic University, 2013.
Includes bibliography.
Mode of access: World Wide Web.
System requirements: Adobe Reader.
Subject(s): Container terminals -- Management
Marine terminals -- Management
Transportation -- Planning
Freight and freightage -- United States
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/3360960
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Owner Institution: FAU