Liner shipping network design and scheduling problem
The liner shipping network design and scheduling problem (LSNDSP) is a mathematical optimization problem in operations research 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]
In 2024, resarchers from Google's Operations Research group announced that they had produced a new optimization technique which outperformed all previous solutions to the problem, and offered substantial increases in both profit and througput for shipping companies.[5]
References
[edit]- ^ 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.
- ^ 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.
- ^ 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.
- ^ "LSNDSP Benchmarks | Operations Research API". Google for Developers. Retrieved 2025-05-09.
- ^ Johnson, Eric (6 June 2024). "Google researchers take aim at liner network design challenge". Journal of Commerce. Retrieved 2025-05-09.
See also
[edit]
 | This computer science article is a stub. You can help Wikipedia by expanding it. |