Summary: According to characteristics of logistics distribution in B2C (business to customer) electronic commerce, a mathematical model for the vehicle routing problem (VRP) with time reservation is developed. An ant colony algorithm for solving multi-objective optimization is designed. Each objective has the same importance. The algorithm introduces factors of booking time window width and vehicle waiting time into state transfer rules, and records the Pareto optimal solution generated in the optimal process. The Pareto optimal set is employed to guide the pheromone-updating tactics. Improved Solomon data are adopted in emulation experiments. The Solomon optimal solution is compared with the result of emulation experiments. Experimental results show the rationality of the proposed model and the effectiveness of the algorithm.