Skip to main content

Tramp Ship Routing with Bunker Optimization and Flexible Cargo Quantities: Case from Dry Bulk Shipping

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14239))

Included in the following conference series:

  • 541 Accesses

Abstract

We study the Tramp Ship Routing and Scheduling Problem with Bunker Optimization (TSRSPBO). The TSRSPBO includes, in addition to the routing and scheduling of the vessels in the given fleet, decisions about how much to bunker (refuel) in which ports. Furthermore, the cargo quantities to be transported are given in an interval, which means that determining the optimal transport quantities also becomes a decision. We propose an arc flow model and a solution method based on a reformulation into a path flow model that uses all feasible vessel routes (columns) as input. For each route, we determine the optimal bunker amounts and cargo quantities along the route. The path flow solution method is tested on a set of instances generated based on data from our case company. The computational results show that the path flow solution method outperforms the arc flow model solved by a commercial solver. We also present how chartering managers may use this as decision support in the negotiation of freight contracts and bunker prices.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Notes

  1. 1.

    www.westernbulk.com.

  2. 2.

    www.maritimeoptima.com.

References

  1. Bai, X., Cheng, L., Çağatay, I.: Data-driven financial and operational risk management: empirical evidence from the global tramp shipping industry. Transp. Res. Part E: Logistics Transp. Rev. 158, 102617 (2022). https://doi.org/10.1016/j.tre.2022.102617

    Article  Google Scholar 

  2. Brønmo, G., Christiansen, M., Nygreen, B.: Ship routing and scheduling with flexible cargo sizes. J. Oper. Res. Soc. 58(9), 1167–1177 (2007). https://doi.org/10.1057/palgrave.jors.2602263

    Article  Google Scholar 

  3. BunkerEx: BunkerEx | Bunker Prices | Bunker Broker United Kingdom (2022). https://www.bunker-ex.com. (accessed 2022-11-11)

  4. Christiansen, M., Fagerholt, K.: Chapter 13: ship routing and scheduling in industrial and tramp shipping. In: Toth, P., Vigo, D. (eds.) Vehicle Routing, pp. 381–408. Society for Industrial and Applied Mathematics, Philadelphia, PA (2014). https://doi.org/10.1137/1.9781611973594.ch13

  5. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Chapter 4 maritime transportation. In: Barnhart, C., Laporte, G. (eds.) Handbooks in Operations Research and Management Science, Transportation, vol. 14, pp. 189–284. Elsevier (2007). https://doi.org/10.1016/S0927-0507(06)14004-9

  6. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228(3), 467–483 (2013). https://doi.org/10.1016/j.ejor.2012.12.002

    Article  Google Scholar 

  7. dos Santos, P.T.G., Kretschmann, E., Borenstein, D., Guedes, P.C.: Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company. Comput. Oper. Res. 119, 104934 (2020). https://doi.org/10.1016/j.cor.2020.104934

    Article  Google Scholar 

  8. Korsvik, J.E., Fagerholt, K.: A tabu search heuristic for ship routing and scheduling with flexible cargo quantities. J. Heuristics 16(2), 117–137 (2010). https://doi.org/10.1007/s10732-008-9092-0

    Article  Google Scholar 

  9. Ksciuk, J., Kuhlemann, S., Tierney, K., Koberstein, A.: Uncertainty in maritime ship routing and scheduling: a Literature review. Eur. J. Oper. Res. 308, 499–524 (2023). https://doi.org/10.1016/j.ejor.2022.08.006

    Article  Google Scholar 

  10. Meng, Q., Wang, S., Lee, C.Y.: A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem. Transp. Res. Part B: Methodol. 72, 1–19 (2015). https://doi.org/10.1016/j.trb.2014.11.008

    Article  Google Scholar 

  11. Pache, H., Kastner, M., Jahn, C.: Current state and trends in tramp ship routing and scheduling. In: Hamburg International Conference of Logistics (HICL), vol. 28, pp. 369–394. epubli GmbH (2019). https://doi.org/10.15480/882.2504

  12. UNCTAD: Review of maritime transport 2021. United Nations, S.l. (2022). https://unctad.org/publication/review-maritime-transport-2021, Accessed 19 June 2023

  13. Vilhelmsen, C., Lusby, R., Larsen, J.: Tramp ship routing and scheduling with integrated bunker optimization. EURO J. Transp. Logistics 3(2), 143–175 (2013). https://doi.org/10.1007/s13676-013-0039-8

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Meisel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Omholt-Jensen, S., Fagerholt, K., Meisel, F. (2023). Tramp Ship Routing with Bunker Optimization and Flexible Cargo Quantities: Case from Dry Bulk Shipping. In: Daduna, J.R., Liedtke, G., Shi, X., Voß, S. (eds) Computational Logistics. ICCL 2023. Lecture Notes in Computer Science, vol 14239. Springer, Cham. https://doi.org/10.1007/978-3-031-43612-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43612-3_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43611-6

  • Online ISBN: 978-3-031-43612-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics