Abstract:

Joint distribution is an effective way to make better utilization of logistics resources and reduce the logistics cost. In this context, the paper proposes a new variant of Vehicle Routing Problem called Vehicle Routing Problem with Request Selection, where a carrier can entrust requests to an external carrier or receive requests from other partners. The carrier needs to optimize the routes as well as selecting the requests. For this problem, a mixed integer programming model is established to maximize the benefit of the carrier. A genetic algorithm is designed to solve the NP-Hard problem. And an optimal split algorithm is proposed to obtain the feasible solution construction of the decimal chromosome coding. We further conduct numerical experiments on instances with different sizes with Matlab. The results show that the two-way entrustment can help reduce the vehicle miles traveled and increase the benefit of the carrier, which also provides the theoretical basis for the individual behavior of joint distribution.

Key words: logistics engineering, vehicle routing, genetic algorithm, joint distribution, request selection, twoway entrustment

摘要：

共同配送能够有效提高物流资源利用率，降低物流成本，在此环境下，本文提出了一种带订单选择的车辆路径问题.运输企业可以将运输订单委托给合作企业或者接受合作企业发布的订单，需要同时进行订单选择和车辆路径优化.针对该问题，以最大化企业经济效益为优化目标，建立混合整数规划模型.针对此NP-Hard问题设计了遗传算法进行求解，提出了对该问题染色体编码的一种精确分割算法以得到可行解的结构.本文构造了不同规模的算例，使用Matlab进行数值实验.结果表明，运输企业通过订单的双向委托，能够有效减小车辆行驶距离的同时提高企业的经济效益，为共同配送系统中的个体行为分析提供了理论基础.

关键词: 物流工程, 车辆路径, 遗传算法, 共同配送, 订单选择, 双向委托