New formulations for the Scheduled Service Network Design Problem

We propose a new approach to formulating the Scheduled Service Network Design Problem (SSNDP) that involves modeling with enumerated consolidations of shipments routed on physical network. This is in contrast classical capturing synchronization vehicles and needed for consolidation time-expanded The proposed formulation has both stronger linear relaxation less symmetric. present multiple speed-up techniques an extensive computational study illustrate consolidation-based much easier solve off-the-shelf solver than based To avoid instances involving large numbers we hybrid combines ideas from network-based approaches SSNDP. show are pure those network formulation. Finally, discuss how facilitates issues have not yet been addressed literature, such as bin-packing considerations when computing vehicle capacity needs. In addition, technique yields wherein modeled aggregate sense.