scholarly journals Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances

Networks ◽  
2015 ◽  
Vol 65 (2) ◽  
pp. 129-138 ◽  
Author(s):  
Pasquale Avella ◽  
Maurizio Boccia ◽  
Laurence A. Wolsey
Keyword(s):  
Computational Experience ◽  
Inventory Routing ◽  
Vendor Managed Inventory ◽  
Routing Problem ◽  
Single Item ◽  
Inventory Routing Problem ◽  
Benchmark Instances

scholarly journals A Two-Stage Matheuristic Algorithm for Classical Inventory Routing Problem

2020 ◽  
Author(s):  
Zhouxing Su ◽  
Shihao Huang ◽  
Chungen Li ◽  
Zhipeng Lü
Keyword(s):  
Inventory Management ◽  
Minimum Cost ◽  
Inventory Routing ◽  
Two Stage ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Fine Grained ◽  
Second Stage ◽  
Benchmark Instances ◽  
Single Vehicle

The inventory routing problem (IRP), which is NP-hard, tackles the combination of inventory management and transportation optimization in supply chains. It seeks a minimum-cost schedule which utilizes a single vehicle to perform deliveries in multiple periods, so that no customer runs out of stock. Specifically, the solution of IRP can be represented as how many products should be delivered to which customer during each period, as well as the route in each period. We propose a two-stage matheuristic (TSMH) algorithm to solve the IRP. The first stage optimizes the overall schedule and generates an initial solution by a relax-and-repair method. The second stage employs an iterated tabu search procedure to achieve a fine-grained optimization to the current solution. Tested on 220 most commonly used benchmark instances, TSMH obtains advantages comparing to the state-of-the-art algorithms. The experimental results show that the proposed algorithm can obtain not only the optimal solutions for most small instances, but also better upper bounds for 40 out of 60 large instances. These results demonstrate that the TSMH algorithm is effective and efficient in solving the IRP. In addition, the comparative experiments justify the importance of two optimization stages of TSMH.

New Formulation for an Economic Order Quantity Distribution Policy in Vendor-Managed Inventory Routing Problems

2014 ◽  
Vol 945-949 ◽  
pp. 3219-3236 ◽  
Author(s):  
Thiago Guimarães ◽  
Cassius Tadeu Scarpin ◽  
Maria Teresinha Arns Steiner
Keyword(s):  
Planning Horizon ◽  
Transportation Costs ◽  
Economic Order Quantity ◽  
Economic Order ◽  
Inventory Routing ◽  
Order Quantity ◽  
Vendor Managed Inventory ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
New Formulation

In vendor managed inventory systems, logistics decisions are centralized at the vendor, allowing inventory storage and transportation costs to be reduced simultaneously. Operation of such systems requires the solution of a complex combinatorial optimization problem, known as the Inventory Routing Problem (IRP), which involves managing client inventory and determining the frequency and size of product deliveries as well as the route taken by the vehicle over a given planning horizon. We present a new formulation based on an economic order quantity distribution policy for the multivehicle inventory routing problem (MIRP). A mathematical programming model with additional practical constraints was used for the MIRP. A new heuristic approach that breaks the MIRP down into the following two sub-problems was also proposed: one dealing with the scheduling of deliveries and the formation of delivery clusters over the planning horizon, and the second sub-problem, which builds the routes for the delivery clusters using classic route construction heuristics and a procedure for intra-route improvements. Adjustments between routes are performed with the aid of a new large neighborhood search (LNS) strategy. Small, medium-sized and large scenarios with different storage and transportation costs were generated using parameters based on data from the literature. Extensive computational tests were carried out to determine the effectiveness of the proposed distribution policy and the heuristic used.

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

2007 ◽  
Vol 41 (3) ◽  
pp. 382-391 ◽  
Author(s):  
Claudia Archetti ◽  
Luca Bertazzi ◽  
Gilbert Laporte ◽  
Maria Grazia Speranza
Keyword(s):  
Branch And Cut ◽  
Inventory Routing ◽  
Vendor Managed Inventory ◽  
Routing Problem ◽  
Inventory Routing Problem

Solving a vendor-managed inventory routing problem arising in the distribution of bottled water in Morocco

2017 ◽  
Vol 11 (2) ◽  
pp. 168 ◽  
Author(s):  
Jamal Lmariouh ◽  
Leandro C. Coelho ◽  
Nizar Elhachemi ◽  
Gilbert Laporte ◽  
Anouar Jamali ◽  
...  
Keyword(s):  
Bottled Water ◽  
Inventory Routing ◽  
Vendor Managed Inventory ◽  
Routing Problem ◽  
Inventory Routing Problem

A genetic algorithm for the vendor-managed inventory routing problem with lost sales

2016 ◽  
Vol 53 ◽  
pp. 149-159 ◽  
Author(s):  
Yang-Byung Park ◽  
Jun-Su Yoo ◽  
Hae-Soo Park
Keyword(s):  
Genetic Algorithm ◽  
Lost Sales ◽  
Inventory Routing ◽  
Vendor Managed Inventory ◽  
Routing Problem ◽  
Inventory Routing Problem

Inventory routing problem and its recent development: Review

2010 ◽  
Vol 30 (2) ◽  
pp. 453-457 ◽  
Author(s):  
Cheng-hong FU ◽  
Zhuo FU
Keyword(s):  
Inventory Routing ◽  
Routing Problem ◽  
Development Review ◽  
Inventory Routing Problem
Sign in / Sign up

Export Citation Format

Share Document