We formalize the cyclic inventory routing problem in a line-shaped network.
The problem is relevant, e.g., to routing feeder ships and tow trains.
A complexity analysis identifies cases solvable in polynomial time.
For the NP-hard cases, a dynamic programming procedure is developed.
The computational study identifies costly routing policies.