A coordinated approach to hedge the risks in stochastic inventory-routing problem

The inventory routing problem (IRP) studied in this research involves repeated delivery of products from a depot to a set of retailers that face stochastic demands over a long period. The main objective in the IRP is to design the set of routes and delivery quantities that minimize transportation cost while controlling inventory costs. Traditional IRP focuses on risk-neutral decision makers, i.e., characterizing replenishment policies that maximize expected total net present value, or equivalently, minimize expected total cost over a planning horizon. In this research, for incorporating risk aversion, a hedge-based stochastic inventory-routing system (HSIRS) integrated with Generalized Autoregressive Conditional Heteroskedasticity (GARCH) model and Forward Option Pricing (FOP)model based on Black-Scholes model, from hedge point of view, is proposed to solve the multi-product multi-period inventory routing problem with stochastic demand. Computational results demonstrate the importance of this approach not only to risk-averse decision makers, but also to maximize the net present value at an acceptable service level. As a result, an optimal portfolio (R, s, S) system of product group can be generated to maximize the net present value under an acceptable service level in a given planning horizon. Meanwhile, the target group needed to be served and the relative transportation policy also can be determined accordingly based on the time required to be served as a priori partition to minimize the average transportation costs; hence, the routing assignment problem can be successfully optimized through a Predicting Particle Swarm Optimization algorithm.

[1]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[2]  Jan A. Van Mieghem,et al.  Commissioned Paper: Capacity Management, Investment, and Hedging: Review and Recent Developments , 2003, Manuf. Serv. Oper. Manag..

[3]  Kee H. Chung Inventory Decision under Demand Uncertainty: A Contingent Claims Approach , 1990 .

[4]  M. Schweizer Mean-Variance Hedging for General Claims , 1992 .

[5]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[6]  Wout Dullaert,et al.  A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

[7]  Kee H. Chung,et al.  Risk in Inventory Models: The Case of the Newsboy Problem — Optimality Conditions , 1990 .

[8]  Yee-Ming Chen,et al.  A particle swarm optimization approach to optimize component placement in printed circuit board assembly , 2007 .

[9]  Wout Dullaert,et al.  A multi-start local search algorithm for the vehicle routing problem with time windows , 2004, Eur. J. Oper. Res..

[10]  M. Anvari,et al.  Optimality Criteria and Risk in Inventory Models: The Case of the Newsboy Problem , 1987 .

[11]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[12]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[13]  Tie Su,et al.  A Contingent-Claims Approach to the Inventory-Stocking Decision , 1997 .

[14]  Byung Ro Moon,et al.  A Hybrid Genetic Algorithm For The Vehicle Routing Problem With Time Windows , 2002, GECCO.

[15]  F. Black The pricing of commodity contracts , 1976 .

[16]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[17]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[18]  H. Pham,et al.  Mean‐Variance Hedging and Numéraire , 1998 .

[19]  Martin B. Haugh,et al.  Optimal Control and Hedging of Operations in the Presence of Financial Markets , 2006, Math. Oper. Res..

[20]  J. Hull Fundamentals of Futures and Options Markets , 2001 .

[21]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[22]  D. Duffie,et al.  Mean-variance hedging in continuous time , 1991 .

[23]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[24]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[25]  Luca Bertazzi,et al.  Deterministic Order-Up-To Level Policies in an Inventory Routing Problem , 2002, Transp. Sci..

[26]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..

[27]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[28]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[29]  Niklas Kohl,et al.  Exact methods for time constrained routing and related scheduling problems , 1995 .

[30]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows , 1998, Canadian Conference on AI.