Model and Algorithm of Vehicle Routing Problem with Order Selection

Abstract

Co-delivery can effectively improve the utilization of logistics resources and reduce logistics costs. Under this environment, this paper proposes a vehicle routing problem with order selection. Transportation companies can entrust transportation orders to cooperative enterprises or accept orders issued by cooperative enterprises. At the same time, order selection and vehicle path optimization are needed. In order to optimize the economic benefits of the enterprise, a mixed integer programming model is established. A genetic algorithm is designed to solve this NP-Hard problem, and the chromosome coding of the problem is proposed. An accurate segmentation algorithm to obtain the structure of feasible solutions. This paper constructs examples of different scales and uses Matlab to carry out numerical experiments. The results show that the transportation enterprises can effectively reduce the driving distance of vehicles and improve the enterprise through the two-way entrustment of orders. The economic benefits provide a theoretical basis for the analysis of individual behavior in the common distribution system.