Document Open Access Logo

Cargo Routing Optimization in Liner Shipping Networks

Authors Yousra El Ghazi , Djamal Habet , Cyril Terrioux

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.CP.2025.11.pdf
  • Filesize: 1.07 MB
  • 18 pages
HTML5 Logo HTML (experimental)
LIPIcs.CP.2025.11.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computing methodologies → Artificial intelligence
Keywords
  • Constraint optimization problem
  • modeling
  • solving
  • industrial application

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Given a maritime liner network, the cargo routing problem consists of determining which maritime routes containers will take to be transported from their loading port to their destination port. This constrained optimization problem is an essential task in the context of maritime commodity transportation, both in terms of network design and operational implementation. Several variants of this problem have been considered depending on their usage (e.g. for designing the network or for carrying containers in practice), the constraints taken into account or the criterion to be optimized.
In this article, we address several variants of this problem, relying on the flexibility of Constraint Programming. First, we propose two general COP models. Then, we describe a local search method that can be easily adapted to the desired context. Finally, we experimentally compare our two models and the proposed method.

Cite As Get BibTex

Yousra El Ghazi, Djamal Habet, and Cyril Terrioux. Cargo Routing Optimization in Liner Shipping Networks. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CP.2025.11

Author Details

Yousra El Ghazi
  • Aix Marseille Univ, CNRS, LIS, Marseille, France
Djamal Habet
  • Aix Marseille Univ, CNRS, LIS, Marseille, France
Cyril Terrioux
  • Aix Marseille Univ, CNRS, LIS, Marseille, France

Funding

This work has been funded by Bpifrance under the PIA project Transformation Numérique du Transport Maritime (TNTM).

Supplementary Materials

References

  1. R. Agarwal and Ö. Ergun. Ship Scheduling and Network Design for Cargo Routing in Liner Shipping. Transportation Science, 42(2):175-196, 2008. URL: https://doi.org/10.1287/trsc.1070.0205.
  2. J. F. Álvarez. Joint routing and deployment of a fleet of container vessels. Maritime Economics & Logistics, 11(2):186-208, 2009. URL: https://doi.org/10.1057/mel.2009.5.
  3. M. Ameln, J. S. Fuglum, K. Thun, H. Andersson, and M. Stålhane. A new formulation for the liner shipping network design problem. International Transactions in Operational Research, 28(2):638-659, 2021. URL: https://doi.org/10.1111/itor.12659.
  4. B. D. Brouer, G. Desaulniers, C. V. Karsten, and D Pisinger. A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions. In Computational Logistics - 6th International Conference, ICCL, volume 9335 of Lecture Notes in Computer Science, pages 195-208. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-24264-4_14.
  5. B. D. Brouer, J. F. Álvarez, C. E. M. Plum, D. Pisinger, and M. M. Sigurd. A base integer programming model and benchmark suite for liner-shipping network design. Transportation Science, 48(2):281-312, 2014. URL: https://doi.org/10.1287/trsc.2013.0471.
  6. M. Christiansen, E. O. Hellsten, D. Pisinger, D. Sacramento, and C. Vilhelmsen. Liner shipping network design. European Journal of Operational Research, 286, 2020. URL: https://doi.org/10.1016/j.ejor.2019.09.057.
  7. D. F. Koza. Liner shipping service scheduling and cargo allocation. EJOR, 275, December 2018. URL: https://doi.org/10.1016/j.ejor.2018.12.011.
  8. Y. El Ghazi, D. Habet, and C. Terrioux. A CP Approach for the Liner Shipping Network Design Problem. In CP, pages 16:1-16:21, 2023. URL: https://doi.org/10.4230/LIPICS.CP.2023.16.
  9. M. Giovannini and H. Psaraftis. The profit maximizing liner shipping problem with flexible frequencies: logistical and environmental considerations. Flexible Services and Manufacturing Journal, 31, September 2019. URL: https://doi.org/10.1007/s10696-018-9308-z.
  10. C. V. Karsten, B. D. Brouer, G. Desaulniers, and D. Pisinger. Time constrained liner shipping network design. Transportation Research. Part E: Logistics and Transportation Review, 105:152-162, 2017. URL: https://doi.org/10.1016/j.tre.2016.03.010.
  11. S. Lee, T. Boomsma, and K. Holst. Approximate dynamic programming for liner shipping network design. Annals of Operations Research, pages 1-40, July 2024. URL: https://doi.org/10.1007/s10479-024-06106-1.
  12. Q. Meng, S. Wang, H. Andersson, and K. Thun. Containership routing and scheduling in liner shipping: overview and future research directions. Transportation Science, 48(2):265-280, January 2014. URL: https://doi.org/10.1287/trsc.2013.0461.
  13. R. Neamatian Monemi and S. Gelareh. Network design, fleet deployment and empty repositioning in liner shipping. Transportation Research Part E: Logistics and Transportation Review, 108, July 2017. URL: https://doi.org/10.1016/j.tre.2017.07.005.
  14. J. Mulder and R. Dekker. Methods for strategic liner shipping network design. European Journal of Operational Research, 235:367-377, June 2014. URL: https://doi.org/10.1016/j.ejor.2013.09.041.
  15. S. Ozcan, D. Eliiyi, and L. Reinhardt. Cargo allocation and vessel scheduling on liner shipping with synchronization of transshipments. Applied Mathematical Modelling, 77, July 2019. URL: https://doi.org/10.1016/j.apm.2019.06.033.
  16. L. B. Reinhardt and D. Pisinger. A branch and cut algorithm for the container shipping network design problem. Flexible Services and Manufacturing Journal, 24(3):349-374, 2012. URL: https://doi.org/10.1007/s10696-011-9105-4.
  17. F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming. Elsevier, 2006. Google Scholar
  18. A. Santini, S. Ropke, and L. M. Hvattum. A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. J. Heuristics, 24(5):783-815, 2018. URL: https://doi.org/10.1007/S10732-018-9377-X.
  19. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In CP, volume 1520, pages 417-431, 1998. URL: https://doi.org/10.1007/3-540-49481-2_30.
  20. K. Thun, H. Andersson, and M. Christiansen. Analyzing complex service structures in liner shipping network design. Flexible Services and Manufacturing Journal, 29(3-4):535-552, 2017. URL: https://doi.org/10.1007/s10696-016-9262-6.
  21. P. Van Hentenryck and J.-P. Carillon. Generality versus Specificity: An Experience with AI and OR Techniques. In Proceedings of the National Conference on Artificial Intelligence, pages 660-664, 1988. Google Scholar
  22. S. Wang and Q. Meng. Liner shipping network design with deadlines. Computers & Operations Research, 41:140-149, 2014. URL: https://doi.org/10.1016/j.cor.2013.08.014.
  23. S. Wang, X. Qu, T. Wang, and W. Yi. Optimal container routing in liner shipping networks considering repacking 20 ft containers into 40 ft containers. Journal of Advanced Transportation, 2017:1-9, January 2017. URL: https://doi.org/10.1155/2017/8608032.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact