Circular and optimized planning method and system for garbage collection and transportation

[0047] Example

[0048] A cycle-optimized garbage collection and transportation planning method, according to the garbage points that need to be cleared and the amount of garbage generated in a region, using the principle of cost optimization to calculate the type and quantity of garbage removal vehicles required to complete the garbage removal task, Plan the specifications, quantity and location of the transfer stations that need to be built, calculate the number of transfer vehicles required, and arrange the daily route planning of each garbage removal vehicle and transfer vehicle. The embodiment can solve the problem of waste removal and transfer planning in the region within the optimal cost range, and calculate the overall operating cost. The invention belongs to the technical field of computer software and artificial intelligence, and uses a neural network and an adaptive vibration feedback mechanism to solve the combined explosion problem in planning algorithms.

[0049] The first step is to divide the area according to all the garbage collection points. The amount of garbage contained in each area requires one train to complete the collection and transportation, and the geographical distribution of each garbage collection point is as close as possible to facilitate collection.

[0050] The area division method is as follows:

[0051] Set the weight ratio of the initial planning area, such as 80% of the vehicle load.

[0052] Plan the area, take the farthest undivided operation point from the disposal point, and gradually expand the points until the included weight reaches the load capacity of a car. Rules for taking points: 1. Generate a convex polygon with existing points, and take points not included in the convex polygon. If the point is overweight after taking the point, gradually remove the vertices of the convex polygon (the vertex is the point farthest from the planning area) until it is not overweight ;2. Take the point closest to the point set and add it to the area. If the weight is too heavy, try to add the next 3 points with the next distance. If it is not satisfied, the division ends, otherwise enter 1.

[0053] When the weight of the remaining points is less than the idle ratio, such as 15%, each point is divided into each area according to the principle of proximity, and the weight of each area does not exceed the standard;