The healthcare supply location-inventory-routing problem: A robust approach

2022 ◽  
Vol 158 ◽  
pp. 102588
Author(s):  
Xiaoting Shang ◽  
Guoqing Zhang ◽  
Bin Jia ◽  
Mohammed Almanaseer
Keyword(s):  
Inventory Routing ◽  
Routing Problem ◽  
Robust Approach ◽  
Inventory Routing Problem

An extended robust approach for a cooperative inventory routing problem

2019 ◽  
Vol 116 ◽  
pp. 310-327 ◽  
Author(s):  
Keyvan Fardi ◽  
Saeid Jafarzadeh_Ghoushchi ◽  
Ashkan Hafezalkotob
Keyword(s):  
Inventory Routing ◽  
Routing Problem ◽  
Robust Approach ◽  
Inventory Routing Problem

scholarly journals The Inventory Routing Problem with Demand Moves

2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Annelieke C. Baller ◽  
Said Dabia ◽  
Guy Desaulniers ◽  
Wout E. H. Dullaert
Keyword(s):  
Urban Areas ◽  
Research Literature ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Solution Approach ◽  
Holding Cost ◽  
Inventory Holding Cost ◽  
Problem Instances ◽  
Inventory Holding

AbstractIn the Inventory Routing Problem, customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize total routing and inventory holding cost over a time horizon. If the customers are located relatively close to each other, one has the opportunity to satisfy the demand of a customer by inventory stored at another nearby customer. In the optimization of the customer replenishments, this option can be included to lower total costs. This is for example the case for ATMs in urban areas where an ATM-user that wants to withdraw money could be redirected to another ATM. To the best of our knowledge, the possibility of redirecting end-users is new to the operations research literature and has not been implemented, but is being considered, in the industry. We formulate the Inventory Routing Problem with Demand Moves in which demand of a customer can (partially) be satisfied by the inventory of a nearby customer at a service cost depending on the quantity and the distance. We propose a branch-price-and-cut solution approach which is evaluated on problem instances from the literature. Cost improvements over the classical IRP of up to 10% are observed with average savings around 3%.

scholarly journals The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach

2021 ◽  
pp. 107320
Author(s):  
Vincent F. YU ◽  
Audrey Tedja WIDJAJA ◽  
Aldy GUNAWAN ◽  
Pieter Vansteenwegen
Keyword(s):  
Problem Formulation ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem
Sign in / Sign up

Export Citation Format

Share Document