Solving the Segregated Storage Problem with Benders' Partitioning

We investigate the application of Benders' partitioning to a mixed integer programming formulation of the segregated storage problem. The dual subproblem reduces to an efficiently-solvable network flow problem. This approach is compared empirically to Neebe's multiplier adjustment procedure. Benders' procedure is shown to be computationally effective for an important class of practical applications having high demand-to-capacity ratios and fewer products than compartments.