A shortfall modelling-based solution approach for stochastic cyclic inventory routing

نویسندگان

چکیده

This paper studies the cyclic inventory routing problem with stochastic demand. A geographically dispersed set of retailers demand rates is replenished from a single depot using vehicles limited capacity. For an infinite horizon, fixed-partition policy adopted that partitions into subsets are always together in same route being cyclically repeated. The objective to provide cost efficient buffering variability within distribution plan by providing carefully calibrated safety stock levels at retailers. In doing so, vehicle capacity needs be taken account, since cumulative during cycle may exceed this case, shortfall remains retailer inventories because they not fully replenished, which affects service level (and balance) consecutive cycle(s). An approximate method presented for determining and integrated state-of-the-art metaheuristic solution approach routing. illustrative example experiments on benchmark instances show (i) effect balance route, (ii) accuracy approximation, (iii) added value taking due account design.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm

In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...

متن کامل

A Price-Directed Approach to Stochastic Inventory/Routing

We consider a new approach to stochastic inventory/routing that approximates the future costs of current actions using optimal dual prices of a linear program. We obtain two such linear programs by formulating the control problem as a Markov decision process and then replacing the optimal value function with the sum of single-customer inventory value functions. The resulting approximation yield...

متن کامل

Dynamic and Stochastic Inventory-Routing

The combination of inventory management and vehicle routing decisions yields a difficult combinatorial optimization problem called the Inventory-Routing Problem (IRP). This problem arises when both types of decisions must be taken jointly, which is the case in vendor-managed inventory systems. The IRP has received significant attention in recent years. Several heuristic and exact algorithms are...

متن کامل

The Stochastic Inventory Routing Problem

This work is motivated by the need to solve the inventory routing problem when implementing a business practice called vendor managed inventory replenishment (VMI). With VMI, vendors monitor their customers’ inventories, and decide when and how much inventory should be replenished at each customer. The inventory routing problem attempts to coordinate inventory replenishment and transportation i...

متن کامل

An Inventory Routing Problem for Perishable Products with Stochastic Demands and Direct Deliveries

In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is compos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2023

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2022.06.001