Linearization and Decomposition Methods for Large Scale Stochastic Inventory Routing Problem with Service Level Constraints
32 Pages Posted: 9 Feb 2010
Date Written: January 23, 2010
A stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, for a depot to determine delivery volumes to its customers in each period, and vehicle routes to distribute the delivery volumes. This paper aims to solve a large scale multi-period SIRP with split delivery (SIRPSD) where a customer’s delivery in each period can be split and satisfied by multiple vehicles if necessary. The objective of the problem is to minimize the total inventory and transportation cost while some constraints are given to satisfy other criteria, such as the service level to limit the stockout probability at each customer and the service level to limit the overfilling probability of the warehouse of each customer. In order to tackle the SIRPSD with notorious computational complexity, we propose for it an approximate model, which significantly reduces the number of decision variables compared to its corresponding exact model. We develop a hybrid approach that combines the linearization of nonlinear constraints, the decomposition of the model into sub-models with Lagrangian relaxation, and a partial linearization approach for a sub model. A near optimal solution of the model can be found by the approach, and then be used to construct a near optimal solution of the SIRPSD. Numerical examples show that, for an instance of the problem with 200 customers and 5 periods that contains about 400 thousands decision variables where half of them are integer, our approach can obtain high quality near optimal solutions with a reasonable computational time on an ordinary PC.
Keywords: HB141, L23, P41, inventory routing problem, split delivery, stochastic demand, vehicle routing
JEL Classification: R4, L23, M, M11, L52
Suggested Citation: Suggested Citation