A ring-mesh topology design problem for optical transport networks
Journal of Heuristics
Stochastic programming for nurse assignment
Computational Optimization and Applications
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
INFORMS Journal on Computing
Cutting plane algorithms for solving a stochastic edge-partition problem
Discrete Optimization
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
INFORMS Journal on Computing
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
Computers and Operations Research
Hi-index | 0.00 |
We develop stochastic integer programming techniques tailored toward solving a Synchronous Optical Network (SONET) ring design problem with uncertain demands. Our approach is based on an L-shaped algorithm, whose (integer) master program prescribes a candidate network design, and whose (continuous) subproblems relay information regarding potential shortage penalty costs to the ring design decisions. This naive implementation performs very poorly due to two major problems: (1) the weakness of the master problem relaxations, and (2) the limited information passed to the master problem by the optimality cuts. Accordingly, we enforce certain necessary conditions regarding shortage penalty contributions to the objective function within the master problem, along with a corresponding set of valid inequalities that improves the solvability of the master problem. We also show how a nonlinear reformulation of the model can be used to capture an exponential number of optimality cuts generated by the linear model. We augment these techniques with a powerful upper-bounding heuristic to further accelerate the convergence of the algorithm, and demonstrate the effectiveness of our methodologies on a test bed of randomly generated stochastic SONET instances. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(1), 12–26 2004