A solution approach to the inventory routing problem in a three-level distribution system
European Journal of Operational ResearchPublished 22 October 2010Open access
Jianxiang Li, Feng Chu, Haoxun Chen
Citations43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A decomposition solution approach based on a fixed partition policy where the retailers are partitioned into disjoint and collectively exhaustive sets and each set of retailers is served on a separate route to determine a combined transportation and inventory strategy.
Abstract
International audience
Keywords
Engineering
Operations ResearchAn Effective Heuristic Algorithm for the Traveling-Salesman Problem
3,797 Citations1973Simon Lin, Brian W. Kernighan
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Management ScienceComputational Complexity of the Capacitated Lot Size Problem
536 Citations1982Gabriel R. Bitran, Horácio Hideki Yanasse
The computational complexity of the capacitated lot size problem with a particular cost structure that is likely to be used in practical settings is studied and it is shown that special classes are NP-hard, and that the problem with two items and independent setups is NP- hard.
Operations ResearchDistribution Strategies that Minimize Transportation and Inventory Costs
436 Citations1985Lawrence D. Burns, Randolph W. Hall +2 more
An analytic method for minimizing the cost of distributing freight by truck from a supplier to many customers is developed, derives formulas for transportation and inventory costs, and determines the optimal trade-off between these costs.
Management Science98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
434 Citations1985R. Roundy
Transportation ScienceSavings by Split Delivery Routing
416 Citations1989Moshe Dror, Pierre Trudeau
This paper examines a relaxed version of the generic vehicle routing problem, in which a delivery to a demand point can be split between any number of vehicles, and demonstrates the potential for cost savings through split deliveries.
Transportation ScienceThe Stochastic Inventory Routing Problem with Direct Deliveries
311 Citations2002Anton J. Kleywegt, Vijay S. Nori +1 more
This work forms the inventory routing problem as a Markov decision process, and proposes approximation methods to find good solutions with reasonable computational effort.
Transportation ScienceA Decomposition Approach for the Inventory-Routing Problem
298 Citations2004Ann Melissa Campbell, Martin Savelsbergh
This paper develops a two-phase approach based on decomposing the set of decisions: a delivery schedule is created first, followed by the construction of a set of delivery routes.
Operations ResearchA Location Based Heuristic for General Routing Problems
283 Citations1995Julien Bramel, David Simchi‐Levi
This work presents a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem and shows that the heuristic performs well for both problems and outperforms all published heuristics on a set of standard test problems.
Management ScienceOne Warehouse Multiple Retailer Systems with Vehicle Routing Costs
281 Citations1990Shoshana Anily, Awi Federgruen
A class of low complexity heuristics are described and it is shown under mild probabilistic assumptions that the generated solutions are asymptotically optimal within the above class of strategies.
Journal of the Operational Research SocietyInventory routing problems: a logistical overview
203 Citations2006Noor Hasnah Moin, Saı̈d Salhi
An overview of Supply Chain Management while focussing on the area of Inventory Routing is presented, aiming to provide the state-of-the-art in this area while highlighting the usefulness of the models in practice as well as their limitations.
Operations ResearchA Periodic Inventory Routing Problem at a Supermarket Chain
193 Citations2004Vishal Gaur, Marshall L. Fisher
The development and implementation of a system to solve a vehicle routing and delivery scheduling problem at Albert Heijn resulted in savings of 4% of distribution costs in its first year of implementation and is expected to yield 12%-20% savings as the firm expands its usage.
Transportation Research Part E Logistics and Transportation ReviewA modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
145 Citations2010Shan-Huen Huang, Pei‐Chun Lin
European Journal of Operational ResearchA practical solution approach for the cyclic inventory routing problem
118 Citations2007Birger Raa, El‐Houssaine Aghezzaf
Operations ResearchProbabilistic Analyses and Practical Algorithms for Inventory-Routing Models
118 Citations1998Lap Mui Ann Chan, Awi Federgruen +1 more
This work considers a distribution system consisting of a single warehouse and many geographically dispersed retailers to identify a combined inventory policy and a routing strategy minimizing system-wide infinite horizon costs and constructs a very effective algorithm which is very effective on a set of randomly generated problems.
European Journal of Operational ResearchModel and algorithm for inventory/routing decision in a three-echelon logistics system
91 Citations2007Qiuhong Zhao, Shuang Chen +1 more
The efficiency of the strategy as well as the algorithm are illustrated by comparing computational results with a lower bound and the advantage of the proposed VLNS algorithm is further shown by getting better results for the problems in a two-echelon logistics system.
Management ScienceAn <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem
87 Citations1988Chia‐Shin Chung, Chien-Hua Mike Lin
European Journal of Operational ResearchA partition approach to the inventory/routing problem
60 Citations2006Qiuhong Zhao, Shouyang Wang +1 more
A lower bound of the long-run average cost of any feasible strategy for the considered distribution system is drawn and a tabu search algorithm is designed to find the retailers’ optimal partition regions under the fixed partition policy proposed.
European Journal of Operational ResearchA tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
59 Citations2009Marie-Claude Bolduc, Gilbert Laporte +2 more
A tabu search heuristic is proposed for the split delivery Vehicle Routing Problem with Production and Demand Calendars and two new neighbor reduction strategies are described, effective at reducing computing time and improving the overall solution quality.
Management ScienceProbabilistic Analyses and Algorithms for Three-Level Distribution Systems
58 Citations1998Lap Mui Ann Chan, David Simchi‐Levi
European Journal of Operational ResearchPerformance evaluation of distribution strategies for the inventory routing problem
39 Citations2009Jianxiang Li, Haoxun Chen +1 more
An analytic method is developed for performance evaluation of the strategy for the infinite horizon inventory routing problem with delivery frequency constraint and it is demonstrated that the effectiveness of direct shipping is at least the square root of the smallest utilization ratio of vehicle capacity.
Discrete Applied MathematicsAn asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
38 Citations2004Shoshana Anily, Julien Bramel
A deterministic lower bound on the cost of the optimal fixed partition policy is derived and a probabilistic analysis of the performance of this bound demonstrates that it is asymptotically 98.5%-effective.
European Journal of Operational ResearchThe general multi-retailer EOQ problem with vehicle routing costs
35 Citations1994Shoshana Anily
A simple heuristic is presented which is shown to converge to the lower-bound almost surely under mild probabilistic conditions, when the number of retailers is increased to infinity.
Transportation ScienceAn Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem
35 Citations2007Jaeheon Jung, Kamlesh Mathur
An efficient heuristic procedure is developed that finds a reorder interval for the warehouse, the replenishment quantities for each retailer, and the delivery routes so as to minimize the long-run average inventory and transportation costs.
Probabilistic analysis on three-level distribution systems
4 Citations2007Jianxiang Li, Feng Chu +1 more
A lower bound on the long run average cost over any feasible policies is developed to show that an effective strategy, in which all shipments are delivered from the vendor to the retailers not to pass the warehouse, is at least radic2 asymptotic optimal.