Vehicle routing problem with time reservation under B2C electronic commerce and ant colony algorithm for multi-objective optimization
B2C环境下带预约时间的车辆路径问题及多目标优化蚁群算法

According to characteristics of logistics distribution in B2C(business to customer) electronic commerce, a mathematical model about 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 Pareto optimal solution generated in the optimal process. Pareto optimal set is employed to guide the pheromone-updating tactics. Improved Solomon data are adopted in emulation experiments. Solomon optimal solution is compared with the result of emulation experiments. Experiment results show the rationality of the proposed model and the effectiveness of the algorithm.