Abstract: Taking backhaul into consideration in the haul process, the vehicle routing problem with time windows (VRPTW) becomes the vehicle routing problem with backhaul and time windows (VRPBTW), which is more practical than normal VRPTW. The new problem VRPBTW is therefore proposed to improve the VRPTW so as to get rid of the limitation of haul/backhaul sequence by designing some parameters corresponding to the sequence and available to avoid its rescheduling. Furthermore, the costs of vehicle running, handling/waiting time and other services are all taken into account in defining the objectives, thus providing a definite solution to those objectives. According to the features of the problem, an algorithm is proposed for VRPBTW, of which the routing is feasibly determined via the branch and bound and genetic algorithm and then a solution is given by use of integral programming. An instance is given to prove its validity.