Skip to main content
SpringerLink
Log in

Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

The berth allocation problem is an optimization problem concerning seaside operations at container terminals. This study investigates the dynamic and continuous berth allocation problem (BAP), whose objective is to minimize the total weighted service time and the deviation cost from vessels’ preferred position. The problem is formulated as a mixed integer programming model. Due to that the BAP is NP-hard, two efficient and effective simulated annealing (SA) algorithms are proposed to locate vessels along the quay. The first SA assigns vessels to available positions along the quay from the left to the right, while the second assigns vessels from both sides. Both small and large-scale instances in the literature are tested to evaluate the effectiveness of the proposed SA algorithms using the optimization software Gurobi and heuristic algorithms from the literature. The results indicate that the proposed SAs can provide optimal solutions in small-scale instances and updates the best solutions in large-scale instances. The improvement over other comparing heuristics is statistically significant.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3):615–627

    Article  MathSciNet  Google Scholar 

  • Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675–689

    Article  MathSciNet  Google Scholar 

  • Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: a computational comparison. Transp Res Part E 47(4):461–473

    Article  Google Scholar 

  • Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 27(2):224–262

    Article  Google Scholar 

  • Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transp Sci 39(4):526–538

    Article  Google Scholar 

  • Dai J, Lin W, Moorthy R, Teo CP (2008) Berth allocation planning optimization in container terminals. In: Tang CS, Teo CP, Wei KK (eds) Supply chain analysis. International series in operations research & management science, vol 119. Springer, Boston, MA, pp 69–104

  • de Oliveira RM, Mauri GR, Lorena LAN (2012) Clustering search heuristics for solving a continuous berth allocation problem. Lect Notes Comput Sci 7245:49–62

    Article  Google Scholar 

  • Frojan P, Correcher JF, Alvarez-Valdes R, Koulouris G, Tamarit JM (2015) The continuous berth allocation problem in a container terminal with multiple quays. Expert Syst Appl 42(21):7356–7366

    Article  Google Scholar 

  • Fugazza M (2015) Maritime connectivity and trade. UNCTAD policy issues in international trade and commodities, Research Study Series No. 70. New York and Geneva

  • Guan Y, Cheung RK (2004) The berth allocation problem: models and solution methods. OR Spectrum 26(1):75–92

    Article  MathSciNet  Google Scholar 

  • Guan Y, Xiao WQ, Cheung RK, Li CL (2002) A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper Res Lett 30(5):343–350

    Article  MathSciNet  Google Scholar 

  • Hansen P, Oğuz C (2003) A note on formulation of static and dynamic berth allocation problems. Les Cahiers du GERAD G-2003-30

  • Hansen P, Oğuz C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636–649

    Article  Google Scholar 

  • Imai A, Nagaiwa K, Chan WT (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Transp 31(1):75–94

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Imai A, Nishimura E, Papadimitriou S (2003) Berth allocation with service priority. Transp Res Part B 37(5):437–457

    Article  Google Scholar 

  • Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39(3):199–221

    Article  Google Scholar 

  • Imai A, Zhang JT, Nishimura E, Papadimitriou S (2007) The berth allocation problem with service time and delay time objectives. Marit Econ Logist 9:269–290

    Article  Google Scholar 

  • Imai A, Nishimura E, Papadimitriou S (2008) Berthing ships at a multi-user container terminal with a limited quay capacity. Transp Res Part E 44(1):136–151

    Article  Google Scholar 

  • Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transp Res Part B 37(6):541–560

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecch MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  • Lalla-Ruiz E, Melián-Batista B, Marcos Moreno-Vega J (2012) Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Eng Appl Artif Intell 25(6):1132–1141

    Article  Google Scholar 

  • Lee Y, Chen CY (2009) An optimization heuristic for the berth scheduling problem. Eur J Oper Res 196(2):500–508

    Article  MathSciNet  Google Scholar 

  • Lee DH, Chen JH, Cao JX (2010) The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp Res Part E 46(6):1017–1029

    Article  Google Scholar 

  • Li CL, Cai X, Lee CY (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Trans 30(5):433–445

    Google Scholar 

  • Lim A (1998) The berth planning problem. Oper Res Lett 22(2–3):105–110

    Article  MathSciNet  Google Scholar 

  • Lin SW, Ting CJ (2014) Solving the dynamic berth allocation problem by simulated annealing. Eng Optim 46(3):308–327

    Article  Google Scholar 

  • Lin SW, Yu VF (2012) A simulated annealing heuristic for the team orienteering problem with time windows. Eur J Oper Res 217(1):94–107

    Article  MathSciNet  Google Scholar 

  • Lin SW, Ying KC, Wan SY (2014) Minimization of total service time for the discrete dynamic berth allocation problem by iterated greedy heuristic. Sci World J. doi:10.1155/2014/218925)

    Article  Google Scholar 

  • Mauri GR, Oliveira ACM, Lorena LAN (2008) A hybrid column generation approach for the berth allocation problem. Lect Notes Comput Sci 4972:110–122

    Article  Google Scholar 

  • Mauri GR, Andrade LN, Lorena LAN (2011) A memetic algorithm for a continuous case of the berth allocation problem. In: 2011 international conference on evolutionary computation theory and applications, Paris, France

  • Mauri GR, Ribeiro GM, Lorena LAN, Laporte G (2016) An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Comput Oper Res 70:140–154

    Article  MathSciNet  Google Scholar 

  • McKendall AR, Shan J, Kuppusamy S (2006) Simulated annealing heuristics for the dynamic facility layout problem. Comput Oper Res 33(8):2431–2444

    Article  MathSciNet  Google Scholar 

  • Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1090

    Article  Google Scholar 

  • Monaco MF, Sammarra M (2007) The berth allocation problem: a strong formulation solved by a Lagrangian approach. Transp Sci 41(2):265–280

    Article  Google Scholar 

  • Moorthy R, Teo CP (2006) Berth management in container terminal: the template design problem. OR Spectrum 28(4):495–518

    Article  Google Scholar 

  • Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95

    Article  Google Scholar 

  • Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131(2):282–292

    Article  Google Scholar 

  • Park KT, Kim KH (2002) Berth scheduling for container terminals by using a subgradient optimization technique. J Oper Res Soc 53(9):1054–1062

    Article  Google Scholar 

  • Seckiner SU, Kurt M (2007) A simulated annealing approach to the solution of job rotation scheduling problems. Appl Math Comput 188(1):31–45

    MATH  Google Scholar 

  • Seyedalizadeh Ganji SR, Babazadeh A, Arabshahi N (2010) Analysis of the continuous berth allocation problem in container ports using a genetic algorithm. J Mar Sci Technol 15(4):408–416

    Article  Google Scholar 

  • Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectrum 30(1):1–52

    Article  MathSciNet  Google Scholar 

  • Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research a classification and literature review. OR Spectrum 26(1):3–49

    Article  Google Scholar 

  • Ting CJ, Wu KC, Chou H (2014) Particle swarm optimization algorithm for the berth allocation problem. Expert Syst Appl 41(4):1543–1550

    Article  Google Scholar 

  • Tong CJ, Lau HC, Lim A (1999) Ant colony optimization for the ship berthing problem. Lect Notes Comput Sci 1742:359–370

    Article  Google Scholar 

  • UNCTAD (2016) Review of maritime transportation. In: United Nations conference on trade and development

  • Wang F, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42(4):2186–2196

    Article  Google Scholar 

Download references

Acknowledgement

The authors are grateful to the Ministry of Science and Technology of the Republic of China (Taiwan) and the Linkou Chang Gung Memorial Hospital for financially supporting this research Grants MOST 105-2410-H-182-009-MY2 and CMRPD3G0011, respectively.

Author information

Authors and Affiliations

  1. Department of Information Management, Chang Gung University, Taoyuan, Taiwan, ROC

    Shih-Wei Lin

  2. Department of Industrial Engineering and Management, Ming Chi University of Technology, Taipei, Taiwan, ROC

    Shih-Wei Lin

  3. Department of Neurology, Linkou Chang Gung Memorial Hospital, Taoyuan, Taiwan, ROC

    Shih-Wei Lin

  4. Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan, ROC

    Ching-Jung Ting & Kun-Chih Wu

Authors
  1. Shih-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ching-Jung Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kun-Chih Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ching-Jung Ting.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, SW., Ting, CJ. & Wu, KC. Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flex Serv Manuf J 30, 740–763 (2018). https://doi.org/10.1007/s10696-017-9298-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-017-9298-2

Keywords

Search

Navigation