scholarly journals A genetic algorithm for the integrated berth allocation and quay crane scheduling problem in container terminals

2016 ◽  
Author(s):  
Jie Ren ◽  
Xiao Ting Shang ◽  
Jin Xin Cao
Keyword(s):  
Genetic Algorithm ◽  
Container Terminals ◽  
Scheduling Problem ◽  
Berth Allocation ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

An efficient genetic algorithm for solving the quay crane scheduling problem

2012 ◽  
Vol 39 (18) ◽  
pp. 13108-13117 ◽  
Author(s):  
Narges Kaveshgar ◽  
Nathan Huynh ◽  
Saeed Khaleghi Rahimian
Keyword(s):  
Genetic Algorithm ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

Solving the 3D stowage planning problem integrated with the quay crane scheduling problem by representation by rules and genetic algorithm

2018 ◽  
Vol 65 ◽  
pp. 495-516 ◽  
Author(s):  
Anibal Tavares Azevedo ◽  
Luiz Leduino de Salles Neto ◽  
Antônio Augusto Chaves ◽  
Antônio Carlos Moretti
Keyword(s):  
Genetic Algorithm ◽  
Planning Problem ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Stowage Planning

The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals

2014 ◽  
Vol 587-589 ◽  
pp. 1793-1796
Author(s):  
Chun Ji Wu ◽  
Li Hua Chen ◽  
Qing Yu Zhao ◽  
Jin Xin Cao
Keyword(s):  
Programming Model ◽  
Container Terminals ◽  
Utilization Rate ◽  
Scheduling Problem ◽  
Current Development ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Operation Efficiency ◽  
Quay Cranes ◽  
Practical Operation

With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.

Sign in / Sign up

Export Citation Format

Share Document