Method for simplifying vehicle scheduling network elasticity based on clustering algorithm

Abstract

The invention provides a method for simplifying vehicle scheduling network elasticity based on a clustering algorithm. The method for simplifying vehicle scheduling network elasticity includes: (a) acquiring vehicle scheduling parameter information; (b) based on the vehicle scheduling parameter information, clustering the supply nodes in a vehicle scheduling network based on the clustering algorithm to generate a composite node; (c) establishing a data module based on a clustered result and the vehicle scheduling parameter information; and (d) generating a vehicle scheduling plan according toscheduling target information. The method for simplifying vehicle scheduling network elasticity based on a clustering algorithm overcomes the disadvantages of the vehicle scheduling network in the prior art and reduces the amount of calculation and shortens the calculation time when obtaining the same precision solution.

Description

technical field [0001] The invention belongs to the technical field of vehicle dispatching, in particular to a method for simplifying the elasticity of a vehicle dispatching network based on a clustering algorithm. Background technique [0002] With the development of social economy, vehicle scheduling has increasingly become an important link in the modern logistics system, and the problem of vehicle scheduling is facing more and more new requirements: timeliness, rapidity, scale, and dynamics. The solution requirements of the problem are becoming more and more stringent. The vehicle dispatching network not only has the characteristics of a large number of nodes, complex node attributes, and complex connections that the general network has, but also because of the uncertain number, characteristics and status of nodes in the vehicle dispatching network, the model structure of the vehicle dispatching network is too large. The vehicle scheduling problem is an NP-hard problem ...

AI Technical Summary

Problems solved by technology

The vehicle dispatching network not only has the characteristics of a large number of nodes, complex node attributes, and complex connections that the general network has, but also because of the uncertain number, characteristics and status of nodes in the vehicle dispatching network, the model structure of the vehicle dispatching network is too large. The vehicle scheduling problem is an NP-hard problem (a type of problem that has not been proven to be solved in polynomial time), and the more nodes there are, the solution scale will increase exponentially, which is difficult to analyze, calculate and control

Images