一种求解随机需求库存-路径问题的分解算法

A Decomposing Algorithm for Inventory-routing Problem with Stochastic Demand

将SDIRP分解为基于直接配送的随机库存-路径问题的库存子问题和基于车辆路径问题的路径问子题,并设计了一个基于(s,S)库存策略和修正C-W节约法的启发式算法,最后,通过相应的数值算例验证了算法的有效性。

In this paper, we decomposed the inventory-routing problem with stochastic demand into the inventory sub-problem of the stochastic inventory-routing problem based on direct distribution and the routing sub-problem of VRP, designed a heuristic algorithm based on （s, S） inventory strategy and modified C-W saving method, and finally verified the effectiveness of the algorithm through corresponding numerical example.