Advertisement

Networks and Spatial Economics

, Volume 19, Issue 3, pp 903–927 | Cite as

A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times

  • Shangyao Yan
  • Chung-Cheng LuEmail author
  • Jun-Hsiao Hsieh
  • Han-Chun Lin
Article
  • 111 Downloads

Abstract

This study proposes a berth-flow network modeling approach to deal with the dynamic berth allocation problem (DBAP) with stochastic vessel arrival times. In this approach, uncertain vessel arrival times are represented using discrete probability distributions and a flexible berth allocation scheme based on the blocking plan concept is incorporated into the model to effectively utilize wharf space. This new model is referred to as the stochastic dynamic (vessel arrival) and flexible (berth space) berth allocation problem (SDFBAP) model. The aim is to minimize the sum of the expected values of unanticipated schedule delay costs and the penalties for being unable to service all vessels within the planning horizon. The proposed model is formulated as an integer multi-commodity network flow problem which can be solved with off-the-shelf solvers. Computational experiments are conducted using a real example to demonstrate the effectiveness and efficiency of the SDFBAP model. A simulation-based approach is adopted to evaluate the SDFBAP model. A number of scenario analyses are also conducted to gain insight into important model parameters.

Keywords

Maritime transport Berth allocation Network flow Stochastic vessel arrival times Multi-commodity network flow problem 

Notes

Acknowledgements

This research was supported by the grants (MOST-107-2221-E-008-019 and MOST 105-2410-H-009-062-MY3) from the Ministry of Science and Technology, Taiwan. The authors would also like to thank the anonymous referees for their helpful comments and suggestions on the paper. The work presented in this paper remains the sole responsibility of the authors.

References

  1. Arango C, Cortes P, Onieva L, Escudero A (2013) Simulation-optimization models for the dynamic berth allocation problem. J Comput Aided Civ Infrastruct Eng 28:769–779Google Scholar
  2. 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–627Google Scholar
  3. Birge J, Louveaux F (1997) Introduction to stochastic programming. Springer-Verlag, New YorkGoogle Scholar
  4. Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: a computational comparison. Transp Res E 47(4):461–473Google Scholar
  5. Canestrelli E, Corazza M, De Nadai G, Pesenti R (2017) Managing the ship movements in the port of Venice. Netw Spat Econ 17(3):861–887Google Scholar
  6. Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 27(2-3):224–262Google Scholar
  7. Cheong CY, Tan KC, Liu DK, Lin CJ (2010) Multi-objective and prioritized berth allocation in container ports. Ann Oper Res 180:63–103Google Scholar
  8. Chu JC, Yan S, Huang H-J (2017) A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times. Netw Spat Econ 17(1):41–68Google Scholar
  9. Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39(4):526–538Google Scholar
  10. 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, Berlin, pp 69–104Google Scholar
  11. Erkut E, Tjandra SA, Verter V (2007) Hazardous materials transportation. In: Barnhart C, Laporte G (eds) Handbooks in Operations Research and Management Science, vol 14. Elsevier, North Holland, pp 539–621Google Scholar
  12. Han X-L, Lu Z-Q, Xi L-F (2010) A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur J Oper Res 207:1327–1340Google Scholar
  13. Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res B 35(4):401–417Google Scholar
  14. Imai A, Nishimura E, Papadimitriou S (2003) Berth allocation with service priority. Transp Res B 37(5):437–457Google Scholar
  15. Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res B 39(3):199–221Google Scholar
  16. Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179(2):579–593Google Scholar
  17. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37(1):69–82Google Scholar
  18. Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transp Res B 37(6):541–560Google Scholar
  19. Lee Y, Chen CY (2009) An optimization heuristic for the berth scheduling problem. Eur J Oper Res 196(2):500–508Google Scholar
  20. Lee DH, Chen JH, Cao JX (2010) The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp Res E 46(6):1017–1029Google Scholar
  21. Lin S-W, Ting C-J (2014) Solving the dynamic berth allocation problem by simulated annealing. Eng Optim 46(3):308–327Google Scholar
  22. Monaco MF, Samara M (2007) The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transp Sci 41(2):265–280Google Scholar
  23. Moorthy R, Teo CP (2006) Berth management in container terminal: the template design problem. OR Spectr 28(4):495–518Google Scholar
  24. Murty KG, Liu JY, Wan YW, Linn R (2005) A decision support system for operations in a container terminal. Decis Support Syst 39(3):309–332Google Scholar
  25. 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–292Google Scholar
  26. Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectr 25(1):1–23Google Scholar
  27. Theofanis S, Boile M, Golias MM (2009) Container terminal berth planning: critical review of research approaches and practical challenges. Transp Res Rec 2100:22–28Google Scholar
  28. Tsiotas D, Polyzos S (2015) Analyzing the maritime transportation system in Greece: a complex network approach. Netw Spat Econ 15(4):981–1010Google Scholar
  29. Umang N, Bierlaire M, Vacca I (2013) Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp Res E 54:14–31Google Scholar
  30. Wang F, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42(4):2186–2196Google Scholar
  31. Xu Y, Chen Q, Quan X (2012) Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res 192(1):123–140Google Scholar
  32. Yan S, Tang CH (2007) A heuristic approach for airport gate assignments for stochastic flight delays. Eur J Oper Res 180(2):547–567Google Scholar
  33. Yan S, Tang CH (2008) An integrated framework for inter-city bus scheduling under stochastic bus travel times. Transp Sci 42(3):318–335Google Scholar
  34. Yan S, Chi CJ, Tang CH (2006) Inter-city bus routing and timetable setting under stochastic demands. Transp Res A 40(7):572–586Google Scholar
  35. Yan S, Chen CY, Lin SC (2009) Ship scheduling and container transshipment planning for liners in short term operations. J Mar Sci Technol 14(4):417–435Google Scholar
  36. Yan S, Hsiao F-Y, Chen Y-C (2015a) Inter-school bus scheduling under stochastic travel times. Netw Spat Econ 15(4):1049–1074Google Scholar
  37. Yan S, Lu CC, Hsieh JH, Lin HC (2015b) A network flow model for the dynamic and flexible berth allocation problem. Comput Ind Eng 81:65–77Google Scholar
  38. Zhen L, Lee LH, Chew EP (2011) A decision model for berth allocation under uncertainty. Eur J Oper Res 212:54–68Google Scholar
  39. Zhou P-F, Kang H-G (2008) Study on berth and quay-crane allocation under stochastic environments in container terminal. Syst Eng Theory Pract 28(1):161–169Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Civil EngineeringNational Central UniversityTaoyuanTaiwan
  2. 2.Department of Transportation and Logistics ManagementNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations