In this paper, we deal with the dual-depot heterogeneous vehicle routing problem with simultaneous delivery and pick up(DH-VRPSDP) in reverse logistics. The DH-VRPSDP is a problem of designing vehicle routes in a day of given vehicle to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited only once according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by changing the customer and the vehicle simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.