Skip to main content

The Multi-port Continuous Berth Allocation Problem with Speed Optimization

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2022)

Abstract

We study the multi-port continuous berth allocation problem with speed optimization. This problem integrates vessel scheduling with berth allocation at multiple terminals in a collaborative setting. We propose a graph-based formulation and a branch-and-price method to solve the problem. The results show that the branch-and-price procedure outperforms the baseline solver. In our computational study, we highlight the trade-off between solution quality and computational complexity, as a function of the segment length used to model a continuous quay.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. UNCTAD: Review of maritime transport 2021 UNCTAD. https://unctad.org/system/files/official-document/rmt2021_en_0.pdf. Accessed 7 May 2022

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Kim, K.H., Moon, K.C.: Berth scheduling by simulated annealing. Transp. Res. Part B: Methodol. 37(2), 541–560 (2003)

    Article  Google Scholar 

  6. Lyu, X., Negenborn, R.R., Shi, X., Schulte, F.: A collaborative berth planning approach for disruption recovery. IEEE Open J. Intell. Transp. Syst. 3, 153–164 (2022)

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. Part E: Logist. Transp. Rev. 45(1), 196–209 (2009)

    Article  Google Scholar 

  9. Dulebenets, M.A., Pasha, J., Abioye, O.F., Kavoosi, M.: Vessel scheduling in liner shipping: a critical literature review and future research needs. Flex. Serv. Manuf. J. 33(1), 43–106 (2019). https://doi.org/10.1007/s10696-019-09367-2

    Article  Google Scholar 

  10. Notteboom, T.E., Vernimmen, B.: The effect of high fuel costs on liner service configuration in container shipping. J. Transp. Geogr. 17(5), 325–337 (2009)

    Article  Google Scholar 

  11. Venturini, G., Iris, C., Kontovas, C., Larsen, A.: The multi-port berth allocation problem with speed optimization and emission considerations. Transp. Res. Part D: Transp. Environ. 54, 142–159 (2017)

    Article  Google Scholar 

  12. Dulebenets, M.A.: Minimizing the total liner shipping route service costs via application of an efficient collaborative agreement. IEEE Trans. Intell. Transp. Syst. 20(1), 123–136 (2019)

    Article  Google Scholar 

  13. Martin-Iradi, B., Pacino, D., Ropke, S.: The multiport berth allocation problem with speed optimization: exact methods and a cooperative game analysis. Transp. Sci. 56(4), 972–999 (2022)

    Google Scholar 

  14. Dantzig, G.B., Wolfe, P.: Decomposition principle for linear-programs. Oper. Res. 8(1), 101–111 (1960)

    Article  Google Scholar 

  15. Jans, R.: Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems. Eur. J. Oper. Res. 204(2), 251–254 (2010)

    Article  Google Scholar 

  16. Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65–98 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bernardo Martin-Iradi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Martin-Iradi, B., Pacino, D., Ropke, S. (2022). The Multi-port Continuous Berth Allocation Problem with Speed Optimization. In: de Armas, J., Ramalhinho, H., Voß, S. (eds) Computational Logistics. ICCL 2022. Lecture Notes in Computer Science, vol 13557. Springer, Cham. https://doi.org/10.1007/978-3-031-16579-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16579-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16578-8

  • Online ISBN: 978-3-031-16579-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics