Advertisement

Berth Allocation Planning Optimization in Container Terminals

  • Jam Dai
  • Wuqin Lin
  • Rajeeva Moorthy
  • Chung-Piaw Teo
Part of the International Series In Operations Research & Mana book series (ISOR, volume 119)

We study the problem of allocating berth space for vessels in container terminals, which is referred to as the berth allocation planning problem. We solve the static berth allocation planning problem as a rectangle packing problem with release time constraints, using a local search algorithm that employs the concept of sequence pair to define the neighborhood structure. We embed this approach in a real time scheduling system to address the berth allocation planning problem in a dynamic environment. We address the issues of vessel allocation to the terminal (thus affecting the overall berth utilization), choice of planning time window (how long to plan ahead in the dynamic environment), and the choice of objective used in the berthing algorithm (e.g., should we focus on minimizing vessels’ waiting time or maximizing berth utilization?). In a moderate load setting, extensive simulation results show that the proposed berthing system is able to allocate space to most of the calling vessels upon arrival, with the majority of them allocated the preferred berthing location. In a heavy load setting, we need to balance the concerns of throughput with acceptable waiting time experienced by vessels. We show that, surprisingly, these can be handled by deliberately delaying berthing of vessels in order to achieve higher throughput in the berthing system.

Keywords

Sequence Pair Container Terminal Quay Crane Berth Allocation Problem Schedule Window 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
  2. F. Barahona and R. Anbil (2000). The volume algorithm: producing primal solutions using a subgradient method, Mathematical Programming, 87, 385-399.CrossRefGoogle Scholar
  3. G.G. Brown, S. Lawphongpanich, and K.P. Thurman (1994). Optimizing ship berthing, Naval Research Logistics, 41, 1-15.CrossRefGoogle Scholar
  4. C.Y. Chen and T.W. Hsieh (1999). A time-space network model for the berth allocation problem, Presented at the 19th IFIP TC7 Conference on System Modelling and Optimization.Google Scholar
  5. L.W. Chen (1998). Optimisation problem in a container port, M.Sc. Research Report, SoC, NUS.Google Scholar
  6. J.T. Chia, H.C. Lau, and A. Lim (1999). Ant colony optimization for the ship berthing problem, in P.S. Thiagarajan, R. Yap (Eds.): ASIAN’99, LNCS 1742, pp. 359-370.Google Scholar
  7. J.G. Dai and W. Lin (2005). Maximum pressure policies in stochastic processing networks, Operations Research, 53, 197-218.CrossRefGoogle Scholar
  8. A.V. Fishkin, K. Jansen and L. Porkolab (2001). On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks, in Proceedings 13th International Symposium on Fundamentals of Computation Theory (FCT’01), Rusins Freivalds (Ed.), Riga, LNCS 2138, Springer Verlag, pp. 495-507.Google Scholar
  9. Y.P. Guan and R.K. Cheung (2004). The berth allocation problem: models and solution methods, OR Spectrum, 26, 75-92.CrossRefGoogle Scholar
  10. Y.P. Guan, W.Q. Xiao, R.K. Cheung, and C.-L. Li (2002). A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis, Operations Research Letters, 30, 343-350.CrossRefGoogle Scholar
  11. S. Imahori, M. Yagiura, and T. Ibaraki (2003). Local search algorithms for the rectangle packing problem with general spatial costs, Mathematical Programming Series B, 97, 543-569.CrossRefGoogle Scholar
  12. A. Imai, E. Nishimura, and S. Papadimitriou (2001). The dynamic berth allocation problem for a container port, Transportation Research Part B, 35, 401-417.CrossRefGoogle Scholar
  13. A. Imai, E. Nishimura, and S. Papadimitriou (2003). Berth allocation with service priority, Transportation Research Part B, 37, 437-457.CrossRefGoogle Scholar
  14. K.H. Kim and K.C. Moon (2003). Berth scheduling by simulated annealing, Transportation Research Part B, 37, 541-560.CrossRefGoogle Scholar
  15. C.L. Li, X. Cai, and C.Y. Lee (1998). Scheduling with multiple-job-on-one-processor pattern, IIE Transactions, 30, 433-446.Google Scholar
  16. A. Lim (1998). On the ship berthing problem, Operations Research Letters, 22(2-3), 105-110.CrossRefGoogle Scholar
  17. S.N. Loh (1996), The Quadratic Assignment Problem and its Generalization to the Berth Allocation Problem, Honours Years Project Report, DISCS, NUS.Google Scholar
  18. K.C. Moon (2000). A Mathematical Model and a Heuristic Algorithm for Berth Planning, Unpublished Thesis. Pusan National University.Google Scholar
  19. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani (1996). VLSI module placement based on rectangle packing by the sequence pair, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 15-12, 1518-1524.Google Scholar
  20. H. Murata, K. Fujiyoshi, and M. Kaneko (1998). VLSI/PCB placement with obstacles based on sequence pair, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 17, 60-68.CrossRefGoogle Scholar
  21. Y.M. Park and K.H. Kim (2003). A scheduling method for Berth and Quay cranes, OR Spectrum, 25, 1-23.CrossRefGoogle Scholar
  22. D. Steenken, S. Voss, and R. Stahlbock (2004). Container terminal operation and operations research a classification and literature review, OR Spectrum, 26, 3-49.CrossRefGoogle Scholar
  23. X. Tang, R. Tian, and D.F. Wong (2000). Fast evaluation of sequence pair in block placement by longest common subsequence computation, in Proceedings of the Conference on Design, Automation and Test in Europe, pp. 106-111.Google Scholar
  24. C.J. Tong, H.C. Lau, A. Lim (1999). Ant Colony Optimization for the ship Berthing problem, Asian Computing Science Conference (ASIAN), pp. 359-370.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Jam Dai
    • 1
  • Wuqin Lin
    • 1
  • Rajeeva Moorthy
    • 1
  • Chung-Piaw Teo
    • 2
  1. 1.School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA
  2. 2.Department of Decision SciencesNational University of SingaporeSingapore

Personalised recommendations