scholarly journals Inventory routing of industrial gases with stochastic demand

2021 ◽  
Author(s):  
Bhupeshkumar Gandhi
Keyword(s):  
Stochastic Demand ◽  
Total System ◽  
Inventory Routing ◽  
Routing Problem ◽  
Numerical Examples ◽  
Proposed Model ◽  
Industrial Gases ◽  
Number Of Visits ◽  
The Cost ◽  
Optimal Quantity

This report proposes a methodology to solve the inventory routing problem of industrial gases with stochastic demand. The gas tanker distributes gases from a depot to several dispersed customers in a route, and each customer has stochastic demand modeled by a Brownian motion. The proposed model determines the optimal quantity required to refill each customer by minimizing the cost associated with earliness, which increases number of visits per year, and lateness, which increases probability of stockout. Overall, the proposed model minimizes the total system cost, helps find the optimal tanker capacity for a given route, and improves supplier and customers' relationship. Numerical examples and sensitivity analysis are given to illustrate the proposed model.

scholarly journals Inventory routing of industrial gases with stochastic demand

2021 ◽  
Author(s):  
Bhupeshkumar Gandhi
Keyword(s):  
Stochastic Demand ◽  
Total System ◽  
Inventory Routing ◽  
Routing Problem ◽  
Numerical Examples ◽  
Proposed Model ◽  
Industrial Gases ◽  
Number Of Visits ◽  
The Cost ◽  
Optimal Quantity

This report proposes a methodology to solve the inventory routing problem of industrial gases with stochastic demand. The gas tanker distributes gases from a depot to several dispersed customers in a route, and each customer has stochastic demand modeled by a Brownian motion. The proposed model determines the optimal quantity required to refill each customer by minimizing the cost associated with earliness, which increases number of visits per year, and lateness, which increases probability of stockout. Overall, the proposed model minimizes the total system cost, helps find the optimal tanker capacity for a given route, and improves supplier and customers' relationship. Numerical examples and sensitivity analysis are given to illustrate the proposed model.

An M/M/C/K queueing system in an inventory routing problem considering congestion and response time for post-disaster humanitarian relief: a case study

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahdieh Masoumi ◽  
Amir Aghsami ◽  
Mohammad Alipour-Vaezi ◽  
Fariborz Jolai ◽  
Behdad Esmailifar
Keyword(s):  
Sensitivity Analyses ◽  
Inventory Routing ◽  
Humanitarian Relief ◽  
Exact Methods ◽  
Routing Problem ◽  
Content Type ◽  
Inventory Routing Problem ◽  
The People ◽  
Proposed Model

PurposeDue to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.Design/methodology/approachThis research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.FindingsAccording to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.Originality/valueThe focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.

scholarly journals Using system simulation to search for the optimal multi-ordering policy for perishable goods

2019 ◽  
Vol 7 (1) ◽  
pp. 49
Author(s):  
Y.C. Huang ◽  
X.Y. Chang ◽  
Y.A. Ding
Keyword(s):  
Stochastic Demand ◽  
Optimal Solution ◽  
Practical Applications ◽  
Ordering Policy ◽  
Perishable Goods ◽  
Decision Variables ◽  
Proposed Model ◽  
The Cost ◽  
Optimal Ordering ◽  
Computerized System

<p>This paper explores the possibility that perishable goods can be ordered several times in a single period after considering the cost of Marginal contribution, Marginal loss, Shortage, and Purchasing under stochastic demand. In order to determine the optimal ordering quantity to improve the traditional newsvendor and maximize the total expected profits, and then sensitivity analysis is taken to realize the influence of the parameters on total expected profits and decision variables respectively. In addition, this paper designed a multi-order computerized system with Monte Carlo method to solve the optimal solution under stochastic demand. Based on numerical examples, this paper verified the feasibility and efficiency of the proposed model. Finally, several specific conclusions are drawn for practical applications and future studies.</p>

Sign in / Sign up

Export Citation Format

Share Document