基于客户软时间窗的社区团购配送路径优化

Optimization of Community Group Purchase Distribution Route Based on Customer’s Soft Time window

文中主要研究社区团购配送路径优化问题,针对社区团购车辆调度普遍存在的效率低、成本高、配送时间不确定等问题,以配送时间与总配送费用帕累托最优、顾客满意度最高为目标,构建基于客户软时间窗的社区团购配送车辆路径优化模型,将遗传算法进行改进后对模型求解。经过算例验证,发现通过遗传算法找到的路径能够有效地降低成本,使配送时间更有保障,提高顾客满意度,验证了算法的可行性和有效性。

This article mainly researches community group purchase distribution route optimization problem, in view of ubiquitous problems in the community group purchase vehicle scheduling such as low efficiency, high cost and uncertain distribution time, takes the Pareto optimality of distribution time and total distribution cost and the highest customer satisfaction as the goal, to build a community group purchase distribution vehicle routing optimization model based on customer’s soft time windows and improves genetic algorithm to solve the model.Through the example verification, it is found that the routing found by genetic algorithm can effectively reduce the cost, make the distribution time more secure, improve customer satisfaction, and verify the feasibility and effectiveness of the algorithm.