Inventory routing problem is one of the key issues to achieve integrated management of logistics. Solving this problem effectively, we can improve vehicle utilization, and reduce distribution costs. This paper, concerning the problem in inventory routing of multi-variety, multi-vendor to multi-customers, proposed heuristic algorithm based on greedy rules. The core strategy of the algorithm is to choose circularly the current lowest unit cost routine ---Hamilton delivery routes. Simulation shows that the algorithm reduces the unloaded ratio of truck, raises the efficiency of truck delivery and saves transport costs.