Analysis of vehicle paths for sharing e-commerce logistics resources in China

Abstract

With the change in shopping methods, people have higher and higher requirements for e-commerce logistics transportation. In this paper, we first briefly study the dynamic vehicle path problem under pickup and delivery mixture and determine the modeling idea of regular path adjustment strategy. Then, based on the constraints of vehicle access rules, travel time, vehicle continuity, loading capacity ceiling, dynamic vehicle path adjustment, etc., a mathematical model to minimize the total cost consisting of vehicle call cost, travel cost, and time window penalty cost together is constructed. Finally, a single-objective optimization with the total vehicle distance as the objective is performed on the original data, and the interrelationship between the objectives in the score MOMDVRP algorithm is solved for the optimal route scheme. In the route of the optimal compromise scheme, the distance of each vehicle, although not reaching the equilibrium degree in the social scheme, is much better than the economic scheme and the environmental scheme, and the difference between the longest drive and the shortest drive is 1.47km, which is about 28.79% and 69.9% less than the difference between the economic scheme and the environmental scheme of 2.171km and 495km, and each objective has reached a more balanced state. It is of great practical significance to study the optimization of the shared path of e-commerce logistics transportation resources.

Keywords

• vehicle path optimization
• mopso-mots algorithm
• pso-ts algorithm
• e-commerce logistics
• dynamic demand
• 68t05