A method for area division and path planning of garbage land deployment

CN113935539BActive Publication Date: 2024-11-08NANJING UNIV OF POSTS & TELECOMM +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111257391.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-27
Publication Date
2024-11-08
Estimated Expiration
2041-10-27

AI Technical Summary

Technical Problem

城市垃圾处理方式和能力远不能满足城市建设的需要

Benefits of technology

[0031] The beneficial effects achieved by this invention are: facing the current situation of continuous expansion of urban scale, it solves the problem of rapid increase in the amount of domestic waste in the city, and realizes efficient operation and processing of domestic waste in the region through regional division and optimal route selection. Reduce extra time and labor costs, improve urban garbage processing capacity, solve problems such as the construction of garbage disposal sites that cannot be matched with urban basic facilities, shortage of transfer stations in urban areas, irregular site selection, and insufficient garbage transfer vehicles, and improve the happiness index of the people. .

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113935539B_ABST
    Figure CN113935539B_ABST
Patent Text Reader

Abstract

A method for regional division and path planning of garbage land deployment, firstly collects relevant data of community points and garbage sites, and generates garbage site vectors and community point vectors according to the data; then performs regional division of urban community points and selects the optimal garbage site in the region; finally, according to the results of regional division and optimal garbage site selection, maps the geographical locations of all community points and the optimal garbage site in the region into a graph structure, and then uses the Dijkstra algorithm to realize the function of finding the shortest path in the region, so as to find the optimal transportation route in the region.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology and application technology, and in particular to a method for area division and path planning for garbage land deployment. Background Art

[0002] Domestic research on urban domestic waste mainly focuses on the analysis of the current situation of urban domestic waste collection and transportation, but there is less research on the site selection of urban waste collection and transfer facilities. The research directions mainly include: suitability evaluation of landfill site selection, site selection of waste transfer stations and planning of transportation routes. Waste transfer stations are urban public facilities, and the site selection of urban public facilities is a complex decision-making issue that requires consideration of multiple factors.

[0003] As cities continue to expand and their populations continue to grow, the amount of waste produced by urban life is increasing rapidly. Urban waste treatment methods and capacity are far from meeting the needs of urban construction. Problems such as the construction of waste treatment sites not matching urban infrastructure, shortage of urban transfer stations, irregular site selection, and insufficient garbage transfer vehicles will seriously damage the ecological environment of the region and affect people's happiness index. Summary of the invention

[0004] The purpose of the present invention is to solve the above problems existing in the prior art and to propose a method for area division and path planning for garbage land deployment.

[0005] A method for area division and path planning for garbage land deployment includes the following steps:

[0006] Step 1: Collect the relevant data of community points and garbage sites to form a community point vector and spam site vector

[0007] Step 2: The regional division of urban community points. This part is mainly for regional division. First, the community point vector As a parameter passed into the clustering algorithm, the clustering algorithm is based on All community points in Latitude and longitude Garbage production and predicting waste generation Perform vertex clustering and divide community points with similar features into a cluster in is the number of regions to be divided, thereby completing the region division function;

[0008] In step 3, the selection of the best regional garbage site is mainly based on the garbage site vector For each sub-region Select the best spam site;

[0009] Step 4: Path planning for the garbage land deployment area. All community points within and the optimal spam site for that sub-region The geographical location and other information are mapped into a graph structure, and then the Dijkstra algorithm is used to map the sub-regions Implement the shortest path function to find the optimal transportation route within the sub-area.

[0010] Furthermore, the specific steps of step 1 are as follows:

[0011] Assume that there are Community points and garbage stations, collect relevant data for each community point in the area, and generate a vector for the community point Include community point number Latitude and longitude Total population Garbage production and predicting waste generation Similarly, generate vectors for each spam site Include spam site ID Latitude and longitude Total Capacity in All vectors Forming community point vectors All vectors Form garbage site vector in

[0012] Furthermore, the specific steps of step 2 are as follows:

[0013] Step 2-1, assuming that the area needs to be divided into sub-regions, the community point vector Passed into the clustering algorithm as a parameter;

[0014] Step 2-2, after executing the clustering algorithm, Cluster Then for each sub-region Pick a center point in

[0015] Furthermore, the specific steps of step 3 are as follows:

[0016] Step 3-1, set the initial value, Distance difference vector D v is empty, where

[0017] Step 3-2, if Then execute step 3-3; otherwise jump to step 3-6;

[0018] Step 3-3, if Then execute step 3-4; otherwise jump to step 3-5;

[0019] Step 3-4, for sub-regions Select its center point Then traverse the garbage site vector Select one by one Calculate With center point The distance difference between Then Push in the distance difference vector D v and execute Jump to step 3-3;

[0020] Step 3-5, from the distance difference vector D v Select the smallest distance difference Corresponding spam site vector In As a region The optimal garbage site; finally, reset the distance difference vector D v Leave it empty and get the best spam site Remove implement Jump to step 3-2;

[0021] Steps 3-6, complete the calculation and end the process.

[0022] Furthermore, the specific steps of step 4 are as follows:

[0023] Step 4-1: Sub-area All community points within and the best garbage site in the area Aggregate to vertex vector middle;

[0024] Step 4-2, set the initial value, The adjacency matrix X is empty, where

[0025] Step 4-3, if Then execute step 4-4; otherwise jump to step 4-7;

[0026] Step 4-4, if Then execute step 4-5; otherwise jump to step 4-6;

[0027] Step 4-5, calculate the vertex and vertices The actual distance between in implement and After completing the calculation, jump to step 4-4;

[0028] Steps 4-6, execute and After completing the calculation, jump to step 4-3;

[0029] Step 4-7, forming an adjacency matrix based on the actual distances between the calculated vertices, has completed the operation of mapping the vertex vectors into a graph structure;

[0030] Step 4-8, pass the adjacency matrix X as a parameter into the Dijkstra algorithm to realize the function of finding the shortest path and complete the search for the area The optimal transportation route solution.

[0031] The beneficial effects achieved by the present invention are as follows: in the face of the current situation of the continuous expansion of urban scale, the problem of the rapid increase in the amount of domestic and industrial garbage in the city is solved. Through regional division and optimal route selection, efficient operation and treatment of domestic and industrial garbage in the region are achieved, additional time and labor costs are reduced, and the urban garbage treatment capacity is improved. The problems of the construction of garbage treatment sites not being able to match urban basic facilities, the shortage of urban transfer stations, irregular site selection, and insufficient garbage transfer vehicles are solved, thereby improving people's happiness index. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 This is a flow chart of collecting data related to community points and garbage sites in an embodiment of the present invention.

[0033] Figure 2 This is a flow chart of the division of urban community points and garbage station areas in an embodiment of the present invention.

[0034] Figure 3 The flowchart of selecting the optimal garbage site in a region in an embodiment of the present invention. DETAILED DESCRIPTION

[0035] The technical solution of the present invention is further described in detail below in conjunction with the accompanying drawings.

[0036] The present invention discloses a method for area division and path planning of garbage land deployment, which includes the following four main parts.

[0037] 1. Collect relevant data of community points and garbage sites to form community point vectors and garbage site vectors.

[0038] The specific steps are as follows:

[0039] Step 1: Assume that there are Community points and garbage stations, collect relevant data for each community point in the area, and generate a vector for the community point Include community point number Latitude and longitude Total population Garbage production and predicting waste generation Similarly, generate vectors for each spam site Include spam site ID Latitude and longitude Total Capacity in All vectors Forming community point vectors All vectors Form garbage site vector in

[0040] Second, the regional division part of the urban community point is mainly for the regional division function. First, the community point vector As a parameter passed into the clustering algorithm, the clustering algorithm is based on All community points in Latitude and longitude Garbage production and predicting waste generation Perform vertex clustering and divide community points with similar features into a cluster in is the number of regions to be divided, thereby completing the region division function.

[0041] The method comprises the following steps:

[0042] Step 2-1, assuming that the area needs to be divided into sub-regions, the community point vector Passed into the clustering algorithm as a parameter;

[0043] Step 2-2, after executing the clustering algorithm, Cluster Then for each sub-region Pick a center point

[0044] 3. The selection of the best regional spam site, which is mainly based on the spam site vector For each sub-region Select the best spam site.

[0045] Step 3-1, set the initial value, Distance difference vector D v is empty, where

[0046] Step 3-2, if Then execute step 3-3; otherwise jump to step 3-6;

[0047] Step 3-3, if Then execute step 3-4; otherwise jump to step 3-5;

[0048] Step 3-4, for sub-regions Select its center point Then traverse the garbage site vector Select one by one Calculate With center point The distance difference between Then Push in the distance difference vector D v and execute Jump to step 3-3;

[0049] Step 3-5, from the distance difference vector D v Select the smallest distance difference Corresponding spam site vector In As a region The optimal garbage site; finally, reset the distance difference vector D v Leave it empty and get the best spam site Remove implement Jump to step 3-2;

[0050] Steps 3-6, complete the calculation and end the process.

[0051] 4. Path planning for the inner area of ​​garbage land deployment All community points within and the optimal spam site for that sub-region The geographical location and other information are mapped into a graph structure, and then the Dijkstra algorithm is used to map the sub-regions Implement the shortest path function to find the optimal transportation route within the sub-area.

[0052] Step 4-1: Sub-area All community points within and the best garbage site in the area Aggregate to vertex vector middle;

[0053] Step 4-2, set the initial value, The adjacency matrix X is empty, where

[0054] Step 4-3, if Then execute step 4-4; otherwise jump to step 4-7;

[0055] Step 4-4, if Then execute step 4-5; otherwise jump to step 4-6;

[0056] Step 4-5, calculate the vertex and vertices The actual distance between in implement and After completing the calculation, jump to step 4-4;

[0057] Steps 4-6, execute and After completing the calculation, jump to step 4-3;

[0058] Step 4-7, forming an adjacency matrix based on the actual distances between the calculated vertices, has completed the operation of mapping the vertex vectors into a graph structure;

[0059] Step 4-8, pass the adjacency matrix X as a parameter into the Dijkstra algorithm to realize the function of finding the shortest path and complete the search for the area The optimal transportation route solution.

[0060] The above description is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiment. Any equivalent modifications or changes made by ordinary technicians in this field based on the contents disclosed by the present invention should be included in the protection scope recorded in the claims.

Claims

1. A method for area division and path planning for garbage land deployment, characterized in that: The method comprises the following steps: Step 1: Collect the relevant data of community points and garbage sites to form a community point vector and spam site vector The specific steps of step 1 are as follows: Assume that there are Community points and garbage stations, collect relevant data for each community point in the area, and generate vectors for the community points Include community point number Latitude and longitude Total population Garbage production and predicting waste generation Similarly, generate vectors for each spam site Include spam site ID Latitude and longitude Total Capacity ,in All vectors Forming community point vectors All vectors Form garbage site vector in Step 2: The regional division of urban community points is mainly for the regional division function. First, the community point vector As a parameter passed into the clustering algorithm, the clustering algorithm is based on All community points in Latitude and longitude Garbage production and predicting waste generation Perform vertex clustering and divide community points with similar features into a cluster in is the number of regions to be divided, thereby completing the region division function; In step 3, the selection of the best regional garbage site is mainly based on the garbage site vector For each sub-region Select the best spam site; The specific steps of step 3 are as follows: Step 3-1, set the initial value, Distance difference vector D v is empty, where Step 3-2, if Then execute step 3-3; otherwise jump to step 3-6; Step 3-3, if Then execute step 3-4; otherwise jump to step 3-5; Step 3-4, for sub-regions Select its center point Then traverse the garbage site vector Select one by one , calculate With center point The distance difference between Then Push in the distance difference vector D v and execute Jump to step 3-3; Step 3-5, from the distance difference vector D v Select the smallest distance difference Corresponding spam site vector In As a region The optimal garbage site; finally, reset the distance difference vector D v Leave it empty and get the best spam site Remove implement Jump to step 3-2; Step 3-6, complete the calculation and end the process; Step 4: Path planning for the garbage land deployment area. All community points within The optimal spam site for the sub-region The geographical location information is mapped into a graph structure, and then the Dijkstra algorithm is used to map the sub-regions Implement the shortest path function to find the optimal transportation route within the sub-area; The specific steps of step 4 are as follows: Step 4-1: Sub-area All community points within The best spam site for the area Aggregate to vertex vector middle; Step 4-2, set the initial value, The adjacency matrix X is empty, where Step 4-3, if Then execute step 4-4; otherwise jump to step 4-7; Step 4-4, if Then execute step 4-5; otherwise jump to step 4-6; Step 4-5, calculate the vertex and vertices The actual distance between in implement and After completing the calculation, jump to step 4-4; Steps 4-6, execute and After completing the calculation, jump to step 4-3; Step 4-7, forming an adjacency matrix based on the calculated actual distances between vertices, completing the operation of mapping vertex vectors into a graph structure; Step 4-8, pass the adjacency matrix X as a parameter into the Dijkstra algorithm to realize the function of finding the shortest path and complete the search for the area The optimal transportation route solution.

2. The method for area division and path planning of garbage land deployment according to claim 1, characterized in that: The specific steps of step 2 are as follows: Step 2-1, assuming that the area needs to be divided into sub-regions, the community point vector Passed into the clustering algorithm as a parameter; Step 2-2, after executing the clustering algorithm, Cluster Then for each sub-region Pick a center point in