When considering hub-and-spoke networks with multiple allocation, the classical models of the literature compute solutions with large discount factors for small flows on interhub connections. Addressing the economies of scale issue, a tighter formulation for this problem is presented, bringing forward a special structure. A specialized version of Benders decomposition is then developed to solve large instances in reasonable time.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.