Jump to content

Liner shipping network design and scheduling problem

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by AnomieBOT (talk | contribs) at 18:20, 9 May 2025 (Dating maintenance tags: {{Orphan}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Liner Shipping Network Design and Scheduling Problem (LSNDSP) is a mathematical optimization problem that models maritime transport logistic problems.[1][2] It is of practical interest in the shipping industry, as improvements in mathematical technoques can be directly applied to real-world problems.

The problem consists of the simultaneous resolution of three sub-problems: fleet design, ship scheduling and cargo routing, while minimizing overall cost.[3]

An industry-standard benchmark dataset, LINERLIB, is used to measure the effectiveness of mathematical approaches to the LSNDSP.[4]

References

  1. ^ Koza, David Franz; Desaulniers, Guy; Røpke, Stefan (2018). "Integrated Liner Shipping Network Design and Scheduling, or: Solving a large service network design problem: ROUTE 2018". in proceedings of ROUTE 2018.
  2. ^ Christiansen, Marielle; Hellsten, Erik; Pisinger, David; Sacramento, David; Vilhelmsen, Charlotte (2020-10-01). "Liner shipping network design". European Journal of Operational Research. 286 (1): 1–20. doi:10.1016/j.ejor.2019.09.057. ISSN 0377-2217.
  3. ^ Mulder, Judith; Dekker, Rommert (2014-06-01). "Methods for strategic liner shipping network design". European Journal of Operational Research. Maritime Logistics. 235 (2): 367–377. doi:10.1016/j.ejor.2013.09.041. ISSN 0377-2217.
  4. ^ "LSNDSP Benchmarks | Operations Research API". Google for Developers. Retrieved 2025-05-09.

See also


Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Liner_shipping_network_design_and_scheduling_problem&oldid=1289613235"