scholarly journals An inventory–routing problem with the objective of travel time minimization

2014 ◽  
Vol 236 (3) ◽  
pp. 936-945 ◽  
Author(s):  
Kunpeng Li ◽  
Bin Chen ◽  
Appa Iyer Sivakumar ◽  
Yong Wu
Keyword(s):  
Travel Time ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Time Minimization

Assigning customer-dependent travel time limits to routes in a cold-chain inventory routing problem

2019 ◽  
Vol 133 ◽  
pp. 275-291 ◽  
Author(s):  
Chen Wei ◽  
Wen-Wen Gao ◽  
Zhi-Hua Hu ◽  
Yu-Qi Yin ◽  
Shi-De Pan
Keyword(s):  
Travel Time ◽  
Cold Chain ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Time Limits

scholarly journals OPTIMASI PENDISTRIBUSIAN PRODUK MENGGUNAKAN MODEL FUZZY MULTIOBJEKTIF CYCLICAL INVENTORY ROUTING PROBLEM

2020 ◽  
Vol 9 (1) ◽  
pp. 96
Author(s):  
EKA SUSANTI ◽  
INDRAWATI INDRAWATI ◽  
ROBINSON SITEPU ◽  
ANNISA NABILA ◽  
RISKA WULANDARI
Keyword(s):  
Travel Time ◽  
Fuzzy Numbers ◽  
Inventory Routing ◽  
Delivery Time ◽  
Triangular Fuzzy Numbers ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Traffic Conditions ◽  
Several Variables ◽  
Model Completion

In distribution activities, travel time is influenced by several factors, such as vehicle conditions, traffic conditions and road conditions. Uncertain traffic conditions cause the travel time can not be defined with certainty (uncertain). If several variables are in a uncertain condition then a deterministic approach is not appropriate. Fuzzy approach, can be used to overcome uncertainty conditions. In this study, the optimal route for chicken egg delivery using the fuzzy Multiobjective Cyclical Inventory Routing Problem (FMOCIRP) model with time and cost is expressed by triangular fuzzy numbers. Model completion using Winqsb software. An optimal shipping route is obtained with a total cost of Rp 114,000 and a total delivery time of 132 minutes. The first optimal delivery route is distributor, retailer 1, retailer 2, retailer 3 and back to the distributor. The second route is distributor, retailer 5, retailer 4 and back to the distributor.

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%.

Sign in / Sign up

Export Citation Format

Share Document