We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two ...

We consider the stochastic capacitated transshipment problem for freight transportation where an optimal location of the transshipment facilities, which minimizes the total cost, must be found. The total cost is given by the sum of the total fixed cost plus the expected minimum total flow cost, when the throughput costs of the facilities are random variables with unknown probability distributio...