Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design

Benders decomposition is a broadly used exact solution method for stochastic programs, which has been increasingly applied to solve transportation and logistics planning problems under uncertainty. However, this strategy comes with important drawbacks, such as a weak master problem following the relaxation step that confines the dual cuts to the scenario subproblems. In this paper, we propose a partial Benders decomposition methodology, based on the idea of including explicit information from the scenario subproblems in the master. To investigate the benefits of this methodology, we apply it to solve a general class of two-stage stochastic multicommodity network design models. Specifically, we solve the challenging variant of the model where both the demands and the arc capacities are stochastic. Through an extensive experimental campaign, we clearly show that the proposed methodology yields significant benefits in computational efficiency, solution quality, and stability of the solution process.

Automated summary

This paper proposes a partial Benders decomposition methodology to solve transportation and logistics planning problems under uncertainty by including explicit information from scenario subproblems in the master problem. Experimental results show significant benefits in terms of computational efficiency, solution quality, and stability of the solution process.