Abstract: Vehicle Routing Problem (VRP) as a common problem in the logistics distribution is also a typical NP-hard problem. On the basis of developing a mathematic model for VRP of non-full loads with time windows, the C-W (Clark-Wright) algorithm used in heuristic algorithm is improved with a new C-W algorithm proposed for the VRP of non-full loads with time windows. The performance of this algorithm is analyzed through two different computational examples involving 8 customers and 13 customers. The results showed the new C-W algorithm is easy to implement and readjust on computers with ideal computational results available. However, the precision of the solution will be reduced if the number of customers increases with increasing solution spaces.