scholarly journals Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry

2021 ◽  
Vol 9 (2) ◽  
pp. 351-362 ◽  
Author(s):  
Shunichi Ohmori ◽  
Kazuho Yoshimoto
Keyword(s):  
Mixed Integer ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Vehicle Type ◽  
Experiment Verification ◽  
A Site ◽  
Site Dependency ◽  
Restaurant Chain

We study an inventory routing problem (IRP) for the restaurant chain. We proposed a model a multi-product multi-vehicle IRP (MMIRP) with multi-compatibility and site-dependency (MMIRP-MCSD). The problem was formulated as a mixed integer programming (MIP). This model is difficult to solve because it is a problem that integrates MMIRP, a multi-compartment vehicle routing problem (MCVRP), and a site dependent VRP (SDVRP), each of which is difficult even by itself. Therefore, in this study, we proposed three-stage Math Heuristics based on the cluster-first and route-second method. In the numerical experiment, verification was performed using actual data, and knowledge on the decision making of the optimum vehicle type was obtained.

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.

Mixed integer and heuristics model for the inventory routing problem in fuel delivery

2014 ◽  
Vol 147 ◽  
pp. 593-604 ◽  
Author(s):  
Milorad Vidović ◽  
Dražen Popović ◽  
Branislava Ratković
Keyword(s):  
Mixed Integer ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Fuel Delivery

MODEL AND ALGORITHM FOR AN INVENTORY ROUTING PROBLEM IN CRUDE OIL TRANSPORTATION

2008 ◽  
Vol 07 (02) ◽  
pp. 297-301 ◽  
Author(s):  
QINGNING SHEN ◽  
HAOXUN CHEN ◽  
FENG CHU
Keyword(s):  
Crude Oil ◽  
Large Scale ◽  
Programming Model ◽  
Numerical Test ◽  
Mixed Integer ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Oil Transportation ◽  
Nonlinear Programming Model

In this paper, we study an inventory routing problem (IRP) in crude oil transportation with multiple transportation modes including pipeline and tanker. We consider the problem in a rolling horizon environment with multiple periods as well as the lead-time of transportation and propose a new mixed-integer nonlinear programming model (MINLP). Due to the complexity and large scale of the problem, an effective metaheuristic method GRASP is developed to find near-optimal solutions of the model. Numerical test results of the method are provided.

Sign in / Sign up

Export Citation Format

Share Document