Liner shipping network design and scheduling problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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 techniques 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, researchers 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 throughput for shipping companies.[5]


See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).