An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem

DOI10.1002/net.21796zbMath1397.90048OpenAlexW2769431938WikidataQ57736431 ScholiaQ57736431MaRDI QIDQ4687210

Agostinho Agra, Filipe Rodrigues, Cristina Requejo

Publication date: 11 October 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/24196

zbMATH Keywords

stochastic programmingdemand uncertaintyiterated local searchinventory routinghybrid heuristicadaptive heuristicsample average approximation algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (6)

A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times ⋮ Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands ⋮ Integrating production scheduling and transportation procurement through combinatorial auctions ⋮ A matheuristic solution approach for the production routing problem with visit spacing policy ⋮ Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem ⋮ A shortfall modelling-based solution approach for stochastic cyclic inventory routing

This page was built for publication: An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem