A Vehicle Routing Optimization Method with Time Window Based on Petri Net Theory

Abstract

A vehicle route optimization method with time window based on Petri net theory, firstly, according to the vehicle route problem with time window to be solved, establish a customer data model; then calculate the distance between the distribution center and the customer point, and then establish Mathematical model of the vehicle routing problem with time window, and then based on the customer data model, establish the Petri net model of the vehicle routing problem with time window; then based on the Petri net model, convert the mathematical model into an integer linear programming problem; then call it in MATLAB Relevant programs for integer linear programming problems; finally, use the YALMIP optimization toolbox to solve the program content and analyze the results; the present invention can realize the optimal distribution route of the vehicles in the distribution center, and at the same time make the total distribution distance of the vehicles the shortest, greatly reducing the number of vehicles The transportation cost has a good application prospect.

Description

technical field [0001] The invention belongs to the technical field of logistics, and in particular relates to a vehicle route optimization method with a time window based on Petri net theory. Background technique [0002] With the advancement of science and technology and the vigorous development of the Internet, e-commerce has entered a stage of rapid development, and the scale of logistics and distribution has increased dramatically. Due to the increase in the number of logistics orders, the complexity of the transportation network and the unreasonable distribution routes, the efficiency of logistics distribution has been seriously affected. Therefore, how to scientifically optimize distribution routes and reduce transportation costs is an important research content of the logistics industry. [0003] In the logistics industry, the Vehicle Routing Problem (VRP) is one of the core problems in logistics management and transportation, and its research has attracted widespre...

AI Technical Summary

Problems solved by technology

Heuristic methods are currently the hotspots of research, including parsimony method, simulated annealing method, tabu search method, neural network method, etc. The formula method often does not get the optimal solution

Common mathematical analysis methods include branch and bound method, integer programming method, dynamic programming method, etc. The amount of calculation will increase exponentially with the increase of the problem scale. Although it can obtain the optimal solution, it is not suitable for solving large-scale problems.

Images