【摘要】 同城物流的B2C和O2O包裹如何在短时间内以较少的资源配送到顾客手中,已成为物流管理中亟待解决的问题.以最短配送时间为目标,构建带时间窗的"最后一公里"非线性数学规划模型(VRPTW),为求解此NP-hard问题,设计三阶段启发式算法,首先采用改进的吸引子传播聚类算法实现对配送区域的划分,充分考虑到配送点之间的关联因素;再对同区域相似度较高的订单进行合并;最后规划最短路径,从而建立完整的物流配送体系.通过案例分析,验证了模型的有效性.与传统的二阶段配送模型进行了对比,结果表明,三阶段算法能缩短订单完成时间,降低配送等待时间,提高资源利用率.更多还原

【Abstract】 How to send B2 C and O2 O packages to customers with short time and fewer resources in city logistics has become an urgent problem in logistics management. In this paper,we take the shortest delivery time as our goal,and build nonlinear mathematical programming model of the last mile with time windows. To solve this NP-hard problem,three-stage heuristic algorithm is designed. Firstly,an improved affinity propagation algorithm is used to realize the division of distribution,which fully takes the relationship between distribution points into consideration. Then,we merge orders with higher similarities in the same region. Finally,shortest paths are planned to establish a complete logistics distribution system. Through case analyses,the validity of the model is verified. The result shows that three-stage heuristic algorithm does better in reducing order completion time and waiting time,and in improving resource utilization than traditional two-stage delivery models.更多还原