The discrete and continuous berth allocation problem: models and algorithms

Fierce terminal competition and the need to maximize recourses utilization have led marine terminal operators to the development and application of a rich variety of Berth Scheduling Policies (BSPs). Container terminal operators seek for efficient BSPs that will reduce vessels turnaround time, increase port throughput, lead to higher revenues and increased competitiveness of the port, while at the same time keep customer satisfaction at desired levels. Several issues arise when defining the best BSPs for each port operator and the final decision depends on several factors that include the type and function of the port (dedicated or multi-user terminal, transshipment hub etc), the size and location of the port, nearby competition, type of contractual agreement with the vessel carriers etc. Some of these BSPs and issues have to a certain extend been captured by academic research, but still several attributes need to be investigated and included for these models to represent the state of the practice of container terminal operations. In this dissertation we present new models and solution algorithms that portray different BSPs and attempt to capture the operational environment of a container terminal, while at the same time including attributes of the system that current models lack. The formulations and solutions of mathematical models presented herein, seek to optimally schedule vessels and/or quay cranes to berths in multi-user type of container terminals, without losing its applicability to the private type container terminals. The objective is to present models and algorithms that capture as much as possible of current container terminal operator practices, while minimizing the assumptions made about real world conditions that container terminals operate in.Ph.D.Includes bibliographical references (p. 194-200)