The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel’s service time is minimized. A number of heuristics or metaheuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimizati...

The tremendous increase of containerized trade over the last several years, the resulting congestion in container terminals worldwide, the remarkable increase in containership size and capacity, the increased operating cost of container vessels and the adoption by liner shipping companies of yield management techniques strain the relationships between ocean carriers and container terminal opera...

Container terminals (CTs) play an essential role in the global transportation system. To deal with growing container shipments, a CT needs to better solve the three essential seaside operational problems; berth allocation problem (BAP), quay crane assignment problem (QCAP), and quay crane scheduling problem (QCSP), which affect the performance of a CT considerably. In past studies, the three se...

Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment demurrage charges. In this paper, we focus on integrated Laycan Berth Allocation Quay Crane Assignment Problem, which considers three main decision problems an way: dynamic continuous Problem time-invariant Problem. second part, problem is extended to Specific Assignment, includes ...

This work addresses the Quay Crane Scheduling Problem under availability constraints, whose main goal is to determine the work schedules of the quay cranes allocated to a container vessel in order to carry out its transhipment operations (loading and unloading operations). An Estimation of Distribution Algorithm with shaking procedure is proposed to solve it. The position of the tasks and the o...

Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...

In container terminals, discharging and loading of vessels are critical planning decisions which highly depend on the interaction between the quay cranes and internal trucks, they also have a significant impact on the terminal performance and revenue. Decisions on the assignments of quay cranes and internal trucks to the berthed vessels are typically made sequentially. However, the applicabilit...

In this paper we integrate two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). They are indeed strictly correlated, as the QC profile assigned t...

This paper presents a novel, mixed-integer programming (MIP) model for the quay crane (QC) scheduling and assignment problem, namely QCSAP, in a container port (terminal). Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper, thus, proposes a genetic ...