published_or_final_version / Transport Policy and Planning / Master / Master of Arts

Digitized by Kansas Correctional Industries

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. / 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.

In recent years, there has been an exponential increase in container volume shipment within intermodal transportation systems. Container terminals as part of the global port system represent important hubs within this intermodal transportation system. Thus, the need to improve the operational efficiency is the most important issue for container terminals from an economic standpoint. Moreover, intermodal transportation systems, ports and inland transport facilities should all be integrated into one coordinated plan. More specifically, a method to schedule different types of handling equipment in an integrated way within a container terminal is a popular topic for researchers. However, not many researchers have addresses this topic in relationship to the simulation aspect which will test feasible solutions under real container terminal environment parameters. In order to increase the efficiency of operations, the development of mathematical models and algorithms is critical in finding the best feasible solution. The objective of this study is to evaluate the feasible solution to find the proper number of Yard Trailers (YTs) with the minimal cost for the container terminals. This study uses the Dynamic YTs operation's method as a background for modeling. A mathematical model with various constraints related to the integrated operations among the different types of handling equipment is formulated. This model takes into consideration both serving time of quay cranes and yard cranes, and cost reduction strategies by decreasing use of YTs with the specific objective of minimum total cost including utilization of YTs and vessel berthing. In addition, a heuristic algorithm combined with Monte Carlo Method and Brute-Force Search are employed. The early Stage Technique of Monte Carlo method is proposed to generate vast random numbers to replicate simulation for real cases. / The Brute-Force Search is used for identifying all potential cases specific to the conditions of this study. Some preliminary numerical test results suggest that this method is good for use in conjunction with simulation of container terminal operation. The expected outcome of this research is a solution to obtain the proper number of YTs for transporting containers with a minimum cost; thus, improving the operational efficiency in a container terminal. / by Yueqiong Zhao. / Thesis (M.S.C.S.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.