A solution approach to the inventory routing problem in a three-level distribution system
From MaRDI portal
Publication:541738
DOI10.1016/j.ejor.2010.10.020zbMath1213.90054OpenAlexW1988763622MaRDI QIDQ541738
Feng Chu, Jianxiang Li, Haoxun Chen
Publication date: 7 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.020
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (4)
The two-echelon multi-depot inventory-routing problem ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ Optimal distribution (re)planning in a centralized multi-stage supply network under conditions of the ripple effect and structure dynamics ⋮ An inventory-routing problem with the objective of travel time minimization
Cites Work
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
- A partition approach to the inventory/routing problem
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- A practical solution approach for the cyclic inventory routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Performance evaluation of distribution strategies for the inventory routing problem
- The general multi-retailer EOQ problem with vehicle routing costs
- Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
- Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Distribution Strategies that Minimize Transportation and Inventory Costs
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Savings by Split Delivery Routing
- Computational Complexity of the Capacitated Lot Size Problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The Stochastic Inventory Routing Problem with Direct Deliveries
- A Location Based Heuristic for General Routing Problems
- A Periodic Inventory Routing Problem at a Supermarket Chain
- Inventory routing problems: a logistical overview
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A solution approach to the inventory routing problem in a three-level distribution system
