We present a modeling approach for optimizing intermodal trains schedules based on an infrastructure divided into time-dependent train paths. The formulation can be generalized to a capacitated multi commodity network design model with additional design balance constraints. We present a Tabu Search based metaheuristic to solve large instances of the generalized problem and compare its results on standard network design problems to those obtained using the solver XpressMP.
|Publication status||Published - 2005|
|Event||INFORMS Annual Meeting New Orleans / San Francisco - San Francisco, CA, United States|
Duration: 13 Nov 2005 → 16 Nov 2005
|Conference||INFORMS Annual Meeting New Orleans / San Francisco|
|City||San Francisco, CA|
|Period||13/11/2005 → 16/11/2005|