Decomposing inventory routing problems with approximate value functions

DOI10.1002/nav.20433zbMath1202.90021OpenAlexW2005489211MaRDI QIDQ3065633

Alejandro Toriello, Nemhauser, George I., Savelsbergh, Martin W. P.

Publication date: 6 January 2011

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20433

zbMATH Keywords

inventory routingmixed-integer programapproximate dynamic program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items

Dynamic programming approximation algorithms for the capacitated lot-sizing problem, Heuristics for dynamic and stochastic inventory-routing, Least squares approximate policy iteration for learning bid prices in choice-based revenue management, Scheduling arc maintenance jobs in a network to maximize total flow over time, Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach, Fitting piecewise linear continuous functions, DCA-based algorithms for DC fitting, Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems, Concave regression: value-constrained estimation and likelihood ratio-based inference, A blood bank network design problem with integrated facility location, inventory and routing decisions, An inventory-routing problem with the objective of travel time minimization

Cites Work

• Convex piecewise-linear fitting
• Inventory routing with continuous moves
• Intra market optimization for express package carriers with station to station travel and proportional sorting
• A method for solving ship routing problems with inventory constraints
• Modelling path flows for a combined ship routing and inventory management problem
• Lot sizing and scheduling -- survey and extensions
• An algorithm for approximating piecewise linear concave functions from sample gradients
• An optimization algorithm for the inventory routing problem with continuous moves
• Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• The value function of an integer program
• Dynamics of Exponential Smoothing with Trend and Seasonal Terms
• The Stochastic Inventory Routing Problem with Direct Deliveries
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• Approximate Dynamic Programming
• Column Generation
• A Price-Directed Approach to Stochastic Inventory/Routing
• Valuing American Options by Simulation: A Simple Least-Squares Approach
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• Inventory routing problems: a logistical overview
• Production Planning by Mixed Integer Programming