Research On Variable Speed Multi-objective Time Window Vehicle Routing Problem With Route Selectio

The rapid development of network communication technology greatly promotes the rapid development of e-commerce,leading to the rapid increase of distribution logistics business so that making offline logistics face new challenges.On the one hand,many commodities have strict requirements on the timeliness of logistics distribution,for example,fresh agricultural products are easy to deteriorate and must be delivered to customers in the shortest time.On the other hand,logistics distribution needs to take many factors into account,including operating cost and service level.It has become an urgent problem for logistics enterprises to save distribution costs while creating a good experience for consumers.In this context,it is important to study the logistics distribution path optimization method in complex environments.Vehicle Routing Problem(VRP)is a typical NP difficult problem.This paper extends the traditional VRP.Firstly,the dual-objective vehicle path problem with path selection window is studied,and the customer satisfaction function is designed based on the consideration of different passage periods and road conditions,and a model aimed at minimizing the cost and maximizing satisfaction is solved with improved ant colony algorithm.The simulation results show that the model and improved algorithm are effective and have certain reference value for vehicle distribution path planning in complex road conditions.Secondly,the vehicle routing problem of time-varying multi-path network is studied,and the goal is to minimize the total cost under the constraints such as vehicle capacity and time window.An improved genetic algorithm is proposed,which works through clustering initial solution,on the basis of cross and variable neighborhood search,and use the elite strategy to find the optimal solution.Besides,iterative travel time calculation method is proposed for path selection in order to reduce the calculation time.The effectiveness of the improved algorithm is verified through numerical experiments of different scales,which has certain reference value for urban distribution problems under multi-path networks.