需求单元拆分的农产品电商配送车辆路径优化

Vehicle Routing Optimization with Split Deliveries for the E-commerce Distribution of Agricultural Products

  • 摘要: 为了促进农产品流通,降低农产品电商物流配送成本,研究了一种带软时间窗的需求单元拆分车辆路径问题.通过将传统约束中客户需求不可拆分的条件进行松弛,并将硬时间窗松弛为软时间窗,设计了一种新的需求单元拆分VRP.结合传统带时间窗的车辆路径问题(VRPTW)模型,构建了相应的多目标数学模型,并设计了一个自适应禁忌搜索算法进行求解.计算结果表明,对客户需求实施单元拆分配送,有助于减少使用的车辆数和降低配送成本.另外,在算法中嵌入自适应惩罚机制,接受部分违反约束的邻域解,可增强配送系统的柔性,提升禁忌搜索算法的全局寻优性能.

     

    Abstract: In order to promote the circulation of agricultural products and reduce the logistics distribution cost of agricultural products in the e-commerce industry, we propose a type of vehicle routing problem with soft time windows and split deliveries by unit. By relaxing the traditional condition that the customer demand can not be split, we design a new form of VRP with split deliveries by unit, and the hard time windows are also relaxed to soft time windows. Combined with the traditional model of vehicle routing problem with time windows (VRPTW), we construct a corresponding multi-objective mathematical model, and design an adaptive tabu search algorithm to solve the problem. The optimization results show that the way of split deliveries by unit can cut down the number of vehicle used and reduce the cost of distribution. Besides, embedding adaptive penalty mechanism and accepting some neighborhood solutions that violate the constraints can enhance the flexibility of distribution system and improve the global optimization performance of the tabu search algorithm.

     

/

返回文章
返回