Abstract
The multi-commodity capacitated transportation network design problem is a basic network design model appearing in logistics and supply chain systems. It attempts to simultaneously take into network topology and shipment flows. Strong path type and weak path type formulations for this problem are shown and the sum of transportation costs and establishment costs of routes is minimized. And it is presented that the problem using these formulations can be solved by the column generation technique and the capacity scaling procedure. Numerical examples are illustrated to show the effectiveness of our formulation and solution methods.
