Cost Function Approximation for the Dynamic Scheduled Service Network Design Problem
We consider a stochastic and dynamic variant of the service network design problem in which a logistics service provider (LSP) periodically routes shipments through a network of transshipment locations so that they all reach their destination on time. Consolidation of these shipments opens up potential cost savings for...