Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

DOI10.1287/OPRE.46.1.96zbMath0996.90007DBLPjournals/ior/ChanFS98OpenAlexW2140915849WikidataQ101200273 ScholiaQ101200273MaRDI QIDQ2781136

Lap Mui Ann Chan, David Simchi-Levi, Awi Federgruen

Publication date: 31 July 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/68cba47c2b7899a8922b9093d1e3ef7bceea9f99

zbMATH Keywords

distribution systemprobabilistic boundsdispersed retailersasymptotic effectivenesscombined inventory policyfixed partition policiesrouting strategy minimizing system-wide infinite horizon costssingle warehousezero inventory ordering

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (22)

A partition approach to the inventory/routing problem ⋮ Inventory routing with continuous moves ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ Combinatorial Heuristics for Inventory Routing Problems ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ Stochastic inventory routing with time-based shipment consolidation ⋮ Scheduling logistic activities to improve hospital supply systems ⋮ Analysis of the best double frequency policy in the single link problem with discrete shipping times ⋮ Solving a closed-loop location-inventory-routing problem with mixed quality defects returns in e-commerce by hybrid ant colony optimization algorithm ⋮ Model and algorithm for inventory/routing decision in a three-echelon logistics system ⋮ An optimization algorithm for the inventory routing problem with continuous moves ⋮ Inventory Routing ⋮ The Period Vehicle Routing Problem and its Extensions ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem ⋮ A probabilistic analysis of the multi-period single-sourcing problem ⋮ Improved rounding procedures for the discrete version of the capacitated EOQ problem ⋮ Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system ⋮ A practical solution approach for the cyclic inventory routing problem ⋮ Performance evaluation of distribution strategies for the inventory routing problem ⋮ An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

This page was built for publication: Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models