Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design

DOI10.1016/j.cor.2013.08.020zbMath1348.90165OpenAlexW2164414207MaRDI QIDQ336890

Mike Hewitt, Walter Rei, Teodor Gabriel Crainic

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.020

zbMATH Keywords

network designmachine learningscenario clusteringprogressive hedgingstochastic programs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Implementing Automatic Benders Decomposition in a Modern MIP Solver, Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic, Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty, Decision-based scenario clustering for decision-making under uncertainty, Lagrange dual bound computation for stochastic service network design, Progressive hedging for stochastic programs with cross-scenario inequality constraints, A Scalable Bounding Method for Multistage Stochastic Programs, A Lagrangian decomposition scheme for choice-based optimization, A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, Problem-driven scenario clustering in stochastic optimization, Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach, A machine learning optimization approach for last-mile delivery and third-party logistics, The Benders Dual Decomposition Method, Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse, Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs, Optimization of covered calls under uncertainty, Evaluation of scenario reduction algorithms with nested distance, BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs, An Embarrassingly Parallel Method for Large-Scale Stochastic Programs, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Scenario-based learning for stochastic combinatorial optimisation, Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design, Scheduled service network design with quality targets and stochastic travel times, Constraint generation for risk averse two-stage stochastic programs, Optimization-Driven Scenario Grouping, A Learning-Based Matheuristic for Stochastic Multicommodity Network Design, Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs, Stochastic scheduling of chemotherapy appointments considering patient acuity levels

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Generating Scenario Trees for Multistage Decision Problems
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
• Single source single-commodity stochastic network design
• Integrated supply chain planning under uncertainty using an improved stochastic approach
• Supply chain design under uncertainty using sample average approximation and dual decomposition
• The design of robust value-creating supply chain networks: a critical review
• Partitioning procedures for solving mixed-variables programming problems
• Planning models for freight transportation
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
• An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
• A heuristic for moment-matching scenario generation
• Scenario tree reduction for multistage stochastic programs
• A note on scenario reduction for two-stage stochastic programs
• Taking market forces into account in the design of production-distribution networks: a positioning by anticipation approach
• A stochastic programming approach for supply chain network design under uncertainty
• Capacitated Network Design with Uncertain Demand
• Introduction to Stochastic Programming
• Progressive hedging-based metaheuristics for stochastic network design
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• A stochastic integer programming approach to solving a synchronous optical network ring design problem
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing