Solving the segregated storage problem with Benders’ partitioning

Solving the segregated storage problem with Benders’ partitioning

0.00 Avg rating0 Votes
Article ID: iaor19932401
Country: United Kingdom
Volume: 44
Issue: 2
Start Page Number: 175
End Page Number: 184
Publication Date: Feb 1993
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: storage
Abstract:

The authors 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.

Reviews

Required fields are marked *. Your email address will not be published.