Clarke-Wright algorithm is a well-known heuristic algorithm for the vehicle routing problem, that is, the problem to find routes through which vehicles deliver goods to retailers. The purpose of this paper is to extend the Clarke-Wright algorithm to the vehicle routing problem with the following restrictions: ${cdot}$ capacities of vehicles may not be the same ${cdot}$ vehicles should pick up empty boxes on the way back ${cdot}$ there is a deadline before delivery should be completed for every retailer ${cdot}$ only certain kinds of vehicles may enter the unloading sites of retailers. This paper modifies the Clarke-Wright algorithm for this problem and shows how to solve a real problem by the newly developed algorithm.