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.

scholarly journals Multidepot Heterogeneous Vehicle Routing Problem for a Variety of Hazardous Materials with Risk Analysis

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Bochen Wang ◽  
Qiyuan Qian ◽  
Zheyi Tan ◽  
Peng Zhang ◽  
Aizhi Wu ◽  
...  
Keyword(s):  
Risk Analysis ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Programming Model ◽  
Hazardous Materials ◽  
Mixed Integer ◽  
Small Scale ◽  
Routing Problem ◽  
Heterogeneous Vehicle Routing Problem

This study investigates a multidepot heterogeneous vehicle routing problem for a variety of hazardous materials with risk analysis, which is a practical problem in the actual industrial field. The objective of the problem is to design a series of routes that minimize the total cost composed of transportation cost, risk cost, and overtime work cost. Comprehensive consideration of factors such as transportation costs, multiple depots, heterogeneous vehicles, risks, and multiple accident scenarios is involved in our study. The problem is defined as a mixed integer programming model. A bidirectional tuning heuristic algorithm and particle swarm optimization algorithm are developed to solve the problem of different scales of instances. Computational results are competitive such that our algorithm can obtain effective results in small-scale instances and show great efficiency in large-scale instances with 70 customers, 30 vehicles, and 3 types of hazardous materials.

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.

Sign in / Sign up

Export Citation Format

Share Document