To route and schedule trains over a large complex network can be computationally intensive. One way to reduce complexity could be to "aggregate" suitable sections of a network. In this paper, we present a simulation-based technique to generate delay estimates over track segments as a function of...

A set of agricultural suppliers with low demands can save on long-haul transportation costs by consolidating their product. We consider a system with stochastic demand and a single consolidation point near the suppliers. We propose a look-ahead heuristic that takes advantage of economies of...

Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric "multi-Traveling Salesmen Problem with Time Windows" (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes...