The fixed charge transportation problem generalizes the well-known transportation problem where the costof sending goods from a source to a sink is composed of a fixed cost and a continuous cost proportional to the amount of goods sent. In this paper, we describe a new integer programming formulation with exponentially many variables corresponding to all possible flow patterns to sinks. We show that the linear relaxation of the newformulation is tighter than that of the standard mixed integer programming formulation. We describe different classes of valid inequalities for the new formulation and a column generation method to compute a valid lower bound embedded into an exact branch-and-price algorithm. Computational results on test problems from theliterature show that the new algorithm outperforms the state-of-the-art exact methods from the literature and can solve instances with up to 70 sources and 70 sinks.
- fixed charge
- column generation