Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition

P. M. França and H. P. L. Luna
Additional contact information
P. M. França: Universidade Estadual de Campinas, Campinas, Brazil
H. P. L. Luna: Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

Transportation Science, 1982, vol. 16, issue 2, 113-126

Abstract: The discrete Stochastic Transportation-Location Problem, a mathematical model that captures the impact of uncertainty on location decisions, is a mixture of the classical plant location problem and the stochastic transportation problem. With demand at each destination a random variable, the problem is to minimize the sum of expected holding and shortage costs, (linear) shipping costs, and fixed construction costs. We discuss the use of Generalized Benders Decomposition to solve the resultant mixed-integer nonlinear program; this technique yields (convex) stochastic transportation subprograms, whose optimal multipliers generate constraints (cuts) for a master integer location problem. The selection of optimal multiplier vectors likely to yield rapid convergence is emphasized. Limited computational experience is found to be encouraging.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.2.113 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:16:y:1982:i:2:p:113-126

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().