Crane scheduling method for train reloading at inland intermodal container terminal

2012 ◽  
Author(s):  
E. Pap ◽  
G. Bojanic ◽  
N. Ralevic ◽  
M. Georgijevic ◽  
V. Bojanic
Keyword(s):  
Container Terminal ◽  
Crane Scheduling ◽  
Scheduling Method

A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal

2005 ◽  
Vol 53 (1) ◽  
pp. 45-59 ◽  
Author(s):  
Luigi Moccia ◽  
Jean-François Cordeau ◽  
Manlio Gaudioso ◽  
Gilbert Laporte
Keyword(s):  
Container Terminal ◽  
Branch And Cut ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

scholarly journals An Improved Discrete PSO for Tugboat Assignment Problem under a Hybrid Scheduling Rule in Container Terminal

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Su Wang ◽  
Min Zhu ◽  
Ikou Kaku ◽  
Guoyue Chen ◽  
Mingya Wang
Keyword(s):  
Integer Programming ◽  
Assignment Problem ◽  
Programming Model ◽  
Container Terminal ◽  
Turnaround Time ◽  
Vital Role ◽  
Mixed Integer ◽  
Hybrid Scheduling ◽  
Scheduling Method ◽  
Discrete Pso

In container terminal, tugboat plays vital role in safety of ship docking. Tugboat assignment problem under a hybrid scheduling rule (TAP-HSR) is to determine the assignment between multiple tugboats and ships and the scheduling sequence of ships to minimize the turnaround time of ships. A mixed-integer programming model and the scheduling method are described for TAP-HSR problem. Then an improved discrete PSO (IDPSO) algorithm for TAP-HSR problem is proposed to minimize the turnaround time of ships. In particular, some new redefined PSO operators and the discrete updating rules of position and velocity are developed. The experimental results show that the proposed IDPSO can get better solutions than GA and basic discrete PSO.

Sign in / Sign up

Export Citation Format

Share Document