An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem

DOI10.1016/j.dam.2003.09.005zbMath1058.90009OpenAlexW2009333834MaRDI QIDQ705496

Julien Bramel, Shoshana Anily

Publication date: 31 January 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.005

zbMATH Keywords

Bin packing problemAsymptotic probabilistic analysisInventory routing problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (11)

A two-phase algorithm for the cyclic inventory routing problem ⋮ A partition approach to the inventory/routing problem ⋮ Route and fleet design for cyclic inventory routing ⋮ A new model and hybrid approach for large scale inventory routing problems ⋮ Cooperative game theory and inventory management ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ Industrial aspects and literature survey: Combined inventory management and routing ⋮ Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system ⋮ New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach ⋮ A practical solution approach for the cyclic inventory routing problem ⋮ Performance evaluation of distribution strategies for the inventory routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The general multi-retailer EOQ problem with vehicle routing costs
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
• Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
• Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
• A Location Based Heuristic for General Routing Problems
• Martingale Inequalities and NP-Complete Problems
• A Class of Euclidean Routing Problems with General Route Cost Functions

This page was built for publication: An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem