Benders decomposition applied to multi-commodity, multi-mode distribution planning

Authors:
Ozan Çakır
Affiliations:
Management Science, Degroote School of Business, McMaster University, 1280 Main St., West DSB A-210, Hamilton, Ontario, Canada L8S 4M4
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 6
Cited 3

A cross decomposition algorithm for capacitated facility location

Operations Research
Strategic analysis of integrated production-distributed systems: models and methods

Operations Research
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Airline Network Design

Operations Research
Composite Variable Formulations for Express Shipment Service Network Design

Transportation Science
A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research

A hybrid algorithm for capacitated plant location problem

Expert Systems with Applications: An International Journal
Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems

Expert Systems with Applications: An International Journal
Activity-based divergent supply chain planning for competitive advantage in the risky global environment: A DEMATEL-ANP fuzzy goal programming approach

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

We discuss the solution of a multi-commodity, multi-mode distribution planning problem arising in tactical level supply chain decisions, with using a primal decomposition algorithm, namely, the Benders decomposition. We provide a detailed Benders reformulation of the problem and illustrate the procedure on an example scenario. Benders algorithm, when experimented on this scenario converged to the original MIP solution showing the Benders reformulation of the problem is valid.