Abstract: Vehicle routing problem of simultaneous deliveries and pickups with time windows(VRPSDPTW) is studied under the circumstances of rapidly increasing customers.A multiobjective model is formulated with the minimum number of the vehicles,traveling distances and the sum of traveling times,serving times and waiting times.Decomposition and iteration algorithm based on route set partition is proposed:a solution is divided into several subsets by two strategies,which are respectively solved by record-to-record travel algorithm.Then the best solutions of the subsets are merged to form a new current solution.This process is repeated so that the solution can be gradually improved.Computational results show that this algorithm is effective to resolve vehicle routing problem with time windows of both one-way deliveries and simultaneous deliveries and pickups.