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

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