Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

2013 ◽  
pp. 101-107 ◽  
Author(s):  
Necati Aras ◽  
Yavuz Türkoğulları ◽  
Z. Caner Taşkın ◽  
Kuban Altınel
Keyword(s):  
Container Terminals ◽  
Simultaneous Optimization ◽  
Berth Allocation ◽  
Scheduling Problems ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Quay Crane Assignment

Optimal berth allocation under regular and emergent vessel arrivals

2020 ◽  
pp. 147509022093788
Author(s):  
Abbas Al-Refaie ◽  
Hala Abedalqader
Keyword(s):  
Waiting Time ◽  
Container Terminal ◽  
Allocation Problem ◽  
Container Terminals ◽  
Future Research ◽  
Satisfaction Level ◽  
Berth Allocation ◽  
Scheduling Problems ◽  
Berth Allocation Problem ◽  
Quay Crane Assignment

This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.

scholarly journals Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel

2018 ◽  
Vol 2018 ◽  
pp. 1-19
Author(s):  
Xiaogang Jiao ◽  
Feifeng Zheng ◽  
Ming Liu ◽  
Yinfeng Xu
Keyword(s):  
Heuristic Algorithms ◽  
Programming Model ◽  
Turnaround Time ◽  
Container Terminals ◽  
Berth Allocation ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Hybrid Particle Swarm Optimization ◽  
Approach Channel ◽  
The Impact

This paper addresses the integrated problem of dynamic continuous berth allocation and time-variant quay crane scheduling in container terminals and introduces the factor of tidal impacts into the problem. We mainly consider the impact of tides on the transport capacity of an approach channel that connects quay and anchorage. An integer linear programming model is developed, and then three heuristic algorithms, Genetic Algorithm, Hybrid Particle Swarm Optimization, and Hybrid Simulated Annealing, are proposed to solve the model. Numerical experiments are conducted to verify the efficient performances of the proposed heuristics. Moreover, experimental results also demonstrate the nonignorable impact of tides on the vessel turnaround time and the utilization of berth and quay cranes.

Quay crane scheduling in container terminals

2006 ◽  
Vol 38 (6) ◽  
pp. 723-737 ◽  
Author(s):  
W. C. Ng ◽  
K. L. Mak
Keyword(s):  
Container Terminals ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

Approximation algorithm for uniform quay crane scheduling at container ports

2016 ◽  
Vol 08 (02) ◽  
pp. 1650018 ◽  
Author(s):  
Ming Liu ◽  
Feifeng Zheng ◽  
Yinfeng Xu ◽  
Chengbin Chu
Keyword(s):  
Approximation Algorithm ◽  
Container Terminals ◽  
Container Port ◽  
Quay Crane Scheduling ◽  
Processing Efficiency ◽  
Crane Scheduling ◽  
Quay Cranes ◽  
Container Ports ◽  
Loading And Unloading ◽  
Turn Around Time

At a container port, container vessels are served by quay cranes for loading and unloading containers. Each vessel is typically split into bays from head to tail where containers are stored. Parallel quay cranes can process different bays simultaneously, and their processing efficiency significantly affects the turn-around time of a container vessel. Sharing a single traveling rail, the quay cranes cannot crossover each other, and this phenomenon is referred as the non-crossing constraint. In addition, the quay cranes may have different processing speeds due to gradual equipment updates. Inspired by updating activities of cranes in modern container terminals, this paper studies a scheduling problem with two uniform quay cranes, aiming at minimizing the turn-around time of a vessel, i.e., the makespan. We mainly develop an integrated approximation algorithm which is [Formula: see text]-approximation, where the two quay cranes are of processing speeds 1 and [Formula: see text], respectively.

Sign in / Sign up

Export Citation Format

Share Document