带时间窗的多配送中心协同配送问题研究

Study on Collaborative Distribution Problem of Multi-Distribution with Time Windows

研究了多个配送中心协同配送下的车辆路径问题，建立运力和时间窗约束下的运输成本和时间惩罚成本之和最小化模型．考虑多配送中心路径优化问题的复杂性，提出了基于预分割和再调整的两阶段优化策略，采用罚数分配法分割需求点集合，将问题分解成多个单配送中心路径问题，启发式构建初始解，设计禁忌搜索算法求解．在调整阶段，将各集合中未分配的需求点重新分割，变邻域禁忌搜索再次优化路径．最后给出算例分析，验证了模型的合理性和改进算法的有效性．

This paper studies vehicle routing problem of collaborative distribution with multi-distribution, builds model to minimize the sum of transport cost and time penalty cost with constraints of capacity and time windows. Considering the complexity of route optimization problem in multi-distribution center, presents a two-stage optimization strategy of fore-segmentation and readjustment, divides demand points by penalty number allocation method, and decomposes problem into several single distribution center routing problem, constructs an initial solution by heuristic method, designs tabu search. In adjustment stage, divides demand points of each collection again which undistributed, applies tabu search of variable neighborhood to optimize route again. Finally numerical analysis is given to verify the rationality of this model and the effectiveness of the improved algorithm.