Algorithm for the Inventory-Routing Problem Based on R-System

The inventory-routing problem is an important approach for the enterprises to save energy and improve efficiency. The improvement of the utilization rate of vehicles and the reduction of the dispatching cost can be realized by solving this problem effectively. This thesis focuses on the inventory-routing problem and put forward a heuristic algorithm based on the greedy rules whose key strategy is to cycle select the Hamilton transportation route with the current lowest unit cost. The simulation example indicates that this algorithm can effectively improve the trucking efficiency and save the transporting cost.