Using scenario trees and progressive hedging for stochastic inventory routing problems
From MaRDI portal
Publication:1044243
Recommendations
- Scenario tree-based heuristics for stochastic inventory-routing problems
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Applying the progressive hedging algorithm to stochastic generalized networks
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- Solving stochastic ship fleet routing problems with inventory management using branch and price
Cites work
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 1749231 (Why is no real title available?)
- scientific article; zbMATH DE number 1452995 (Why is no real title available?)
- A Combined Vehicle Routing and Inventory Allocation Problem
- A Price-Directed Approach to Stochastic Inventory/Routing
- An Integrated Inventory Allocation and Vehicle Routing Problem
- Applying the progressive hedging algorithm to stochastic generalized networks
- Inventory routing problems: a logistical overview
- Layering strategies for creating exploitable structure in linear and integer programs
- Oil field optimization under price uncertainty
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Scenario tree-based heuristics for stochastic inventory-routing problems
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Solving multistage stochastic networks: An application of scenario aggregation
- The Stochastic Inventory Routing Problem with Direct Deliveries
- The vehicle routing problem
Cited in
(24)- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- Scenario-based learning for stochastic combinatorial optimisation
- Managing congestion in a multi-modal transportation network under biomass supply uncertainty
- The sample average approximation method for empty container repositioning with uncertainties
- Scheduled service network design with quality targets and stochastic travel times
- BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
- PySP: modeling and solving stochastic programs in Python
- A stochastic programming approach for chemotherapy appointment scheduling
- A survey on metaheuristics for stochastic combinatorial optimization
- Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
- Stochastic inventory routing with time-based shipment consolidation
- Industrial aspects and literature survey: Combined inventory management and routing
- The dynamic bowser routing problem
- A progressive hedging approach for surgery planning under uncertainty
- Recent trends in metaheuristics for stochastic combinatorial optimization
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- Scenario tree-based heuristics for stochastic inventory-routing problems
- Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- Stochastic forestry planning under market and growth uncertainty
- A maritime inventory routing problem with stochastic sailing and port times
- An inventory-routing problem with the objective of travel time minimization
- Progressive hedging-based metaheuristics for stochastic network design
- Benders decomposition for production routing under demand uncertainty
This page was built for publication: Using scenario trees and progressive hedging for stochastic inventory routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044243)
