Integrated discrete berth allocation and quay crane scheduling in port container terminals

The integrated discrete berth allocation and quay crane scheduling problem studied in this article considers the relationship between them. This article provides a mixed integer programming model for the studied problem that is -complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the studied problem.

[1]  Andrew Lim,et al.  Approximation Schemes for the Crane Scheduling Problem , 2004, SWAT.

[2]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[3]  Chung-lun Li,et al.  Scheduling with multiple-job-on-one-processor pattern , 1998 .

[4]  K. K. Lai,et al.  A STUDY OF CONTAINER BERTH ALLOCATION. , 1992 .

[5]  Yi Zhu,et al.  Crane scheduling with spatial constraints , 2004 .

[6]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[7]  Akio Imai,et al.  Efficient planning of berth allocation for container terminals in Asia , 1997 .

[8]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[9]  K. L. Mak,et al.  Quay crane scheduling in container terminals , 2006 .

[10]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[11]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .

[12]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[13]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004, OR Spectr..

[14]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[15]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[16]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[17]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

[18]  Y. Zhu,et al.  Crane scheduling with non-crossing constraint , 2006, J. Oper. Res. Soc..

[19]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[20]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[21]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[22]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

[23]  Kap Hwan Kim,et al.  Container terminals and terminal operations , 2006, OR Spectr..

[24]  Lixin Miao,et al.  Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[25]  Gilbert Laporte,et al.  A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal , 2006 .