  Intermodal logistics typically include the successive stages of intermodal
shipment and last-mile delivery. We investigate this problem under a novel
Logic-Based Benders Decomposition, which exploits the staged nature of the
problem to minimise the sum of transport costs and delivery penalties. We
establish the validity of our decomposition and apply effective optimality
cuts. Apart from models and formal proofs, we provide extensive experimentation
on random instances of considerable scale that shows the improvement achieved
in terms of small gaps and shorter time compared to a monolithic MILP approach.
Last, we propose a major extension of our generic method for a real logistics
case. The implementation of the extension on real instances show the
versatility of our method in terms of supporting different planning approaches
thus leading to actual cost improvements.
