Skip to main content

Advertisement

Log in

A berth allocation planning problem with direct transshipment consideration

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

With the rapid development of container transport industry, container terminal systems have become more and more busy. Some measures and facilities are taken to improve the container throughput, such as Mega Ship, Mega Crane, Deep water Port, Automatic Container Terminal, Mobile Port, Dock Type Berth and Floating Berth. This paper deals with the transshipment transport problem in a container terminal arising from the usage of Mega Ship. We introduce the Berth Allocation Planning problem considering transshipment of ship to ship and formulate a mathematical model with different number of Quay Cranes in berth. A hybrid multistage operation-based Genetic Algorithm (h-moGA) with a priority-based encoding method is proposed. To demonstrate the effectiveness of the proposed h-moGA approach, numerical experiments are carried out and the best solution to the problem is obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Deb K. (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York

    Google Scholar 

  • Ding Y. Z., Fei H. Y., Han X. l. (2004) An overview on container logistics through a terminal. Journal of Shanghai Maritime University 25: 45–54

    Google Scholar 

  • Gen M., Cheng R. (1997) Genetic algorithms & engineering design. Wiley, New York

    Google Scholar 

  • Gen M., Cheng R. (2000) Genetic algorithms and engineering optimization. Wiley, New york

    Google Scholar 

  • Gen M., Cheng R., Lin L. (2008) Network models and optimization: Multiobjective genetic algorithm approach. Springer, London

    Google Scholar 

  • Gen M., Lin L., Zhang H. (2009) Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey. Computers & Industrial Engineering 56(3): 779–808

    Article  Google Scholar 

  • Guan Y., Xiao W. Q. (2002) A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis. Operations Research Letters 30: 343–350

    Article  Google Scholar 

  • Imai A., Nishimura E., Papadimitriou S. (2001) The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological 35: 401–417

    Article  Google Scholar 

  • Imai A., Nishimura E., Papadimitriou S. (2005) Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B: Methodological 39: 199–221

    Article  Google Scholar 

  • Imai A., Nishimura E., Hattori M., Papadimitriou S. (2007) Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 179: 579–593

    Article  Google Scholar 

  • Kim K., Moon K. C. (2003) Berth scheduling by simulated annealing. Transportation Research Part B 37: 541–560

    Article  Google Scholar 

  • Liang, C., & Gen, M. (2006). Hybrid genetic algorithm for considering quay crane scheduling in Berth allocation planning problem. In Proceedings of Asia-Pacific workshop on intelligent and evolutionary systems (APWIES), Busan, Korea.

  • Liang C., Huang Y., Yang Y. (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering 56: 1021–1028

    Article  Google Scholar 

  • Lim A. (1998) The berth planning problem. Operations Research Letters 22: 105–110

    Article  Google Scholar 

  • Lin L., Shinn S. W., Gen M. (2006) Network model and effective evolutionary approach for AGV dispatching in manufacturing system. Journal of Intelligent Manufacturing 17: 465–477

    Article  Google Scholar 

  • Man, Y., & Kim, K. H. (2003). A scheduling method for berth and quay cranes. OR Spectrum. pp. 1–23.

  • Nishimura E., Imai A., Papadimitriou S. (2001) Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 131: 282–292

    Article  Google Scholar 

  • Park K., Kim K. (2003) Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of Operational Research Society 53: 1054–1062

    Google Scholar 

  • Stahlbock R., Stefan V. (2008) Operations research at container terminals: A literature update. OR Spectrum 30(1): 1–52

    Article  Google Scholar 

  • Wang F., Lim A. (2006) A stochastic beam search for the berth allocation problem. Decision Support Systems 20: 1–11

    Google Scholar 

  • Yoo M. R., Gen M. (2007) Scheduling algorithm for real-time tasks using multi-objective hybrid genetic algorithm in heterogeneous multi-processors system. Computers & Operations Research 34(10): 3084–3098

    Article  Google Scholar 

  • Yu X., Gen M. (2010) Introduction to evolutional algorithms. Springer, London

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mitsuo Gen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, C., Hwang, H. & Gen, M. A berth allocation planning problem with direct transshipment consideration. J Intell Manuf 23, 2207–2214 (2012). https://doi.org/10.1007/s10845-011-0566-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-011-0566-9

Keywords

Navigation