A method for selecting a location for garbage disposal in a village

Abstract

The present invention discloses a method for selecting a site for a garbage disposal point in a village, comprising: extracting the outline, road and building information of the village where the garbage disposal point is to be set up through an oblique photographic map; dividing the village into a plurality of road grid areas according to the outline and road information of the village, and the buildings contained in each road grid area form a building set; determining the number of garbage containers required for each road network area; determining the optional site points of each road network area according to the number of garbage containers; calculating the optimal solution for the distribution of optional site points of garbage containers in each road grid area through a simulated annealing algorithm; and determining the overall optimal site selection scheme for the garbage disposal point. The present invention can find a reasonable balance point between the garbage disposal point being close to the building and the building being far away from the garbage disposal point to set up the garbage disposal point, while achieving the convenience of villagers in disposing of garbage and the toxic and harmful gases or substances such as odors generated by the garbage not affecting the villagers' lives and health.

Description

Technical Field

[0001] The invention relates to the field of rural public facility management, and in particular to a method for selecting a site for garbage disposal in a village. Background Art

[0002] In new rural construction or in existing villages, garbage disposal is a daily matter for villagers to deal with garbage, so it is necessary to arrange garbage cans and other garbage containers at the garbage disposal points. Since the buildings in the village are relatively scattered, the establishment of garbage disposal points must not only meet the requirements of garbage disposal points being close to the buildings but also consider that the buildings are far away from the garbage disposal points. The garbage disposal points are close to the buildings to facilitate the villagers to dispose of garbage and not affect the villagers' passage. The buildings are far away from the garbage disposal points to consider that the odor emitted by the garbage does not affect the lives of the villagers in the buildings, and to avoid the villagers in the affected buildings from moving away after the garbage cans are configured at the garbage disposal points. Therefore, how to find a reasonable balance between the garbage disposal points being close to the buildings and the buildings being far away from the garbage disposal points is a technical problem that needs to be solved in the field of garbage disposal point cost. Summary of the invention

[0003] The technical problem to be solved by the present invention is to provide a method for selecting a site for a garbage disposal point in a village, so as to solve the problem of how to find a reasonable balance point between the garbage disposal point being close to a building and the building being far away from the garbage disposal point to set up the garbage disposal point.

[0004] In order to solve the above technical problems, the present invention provides a technical solution: a method for selecting a site for a garbage disposal point in a village, comprising:

[0005] Step 110, extracting the outline, road and building information of the village where the garbage disposal point is to be set up through the oblique photography map;

[0006] Step 120, dividing the village into a plurality of road grid areas according to the village outline and road information, and the buildings contained in each road grid area form a building set;

[0007] Step 130, determining the number of garbage containers required for each road network area;

[0008] Step 140, determining the optional site points in each road network area according to the number of garbage containers;

[0009] Step 150, calculating the optimal solution for the distribution of the optional locations of the garbage containers in each road grid area by using a simulated annealing algorithm;

[0010] Step 160, determine the overall optimal location plan for the garbage disposal point.

[0011] Furthermore, in the method for selecting a location for a garbage disposal point in a village provided by the present invention, the method for determining the number of garbage containers required for each road network area in step 130 includes:

[0012] Step 131, calculate the daily discharge weight of domestic waste within the collection range of the domestic waste collection point according to formula (1):

[0013] Q=A 1 A 2 RC (1);

[0014] in,

[0015] Q represents the daily discharge weight of garbage, in tons / day;

[0016] A 1 Indicates the daily discharge weight unevenness coefficient of garbage, A 1 =1.1-1.5;

[0017] A 2 represents the coefficient of change of resident population, A 2 =1.02-1.05;

[0018] R represents the planned population within the collection scope, in persons;

[0019] C represents the predicted daily per capita garbage discharge weight, in tons / person / day;

[0020] Step 132, calculate the daily discharge volume of domestic waste within the collection range of the domestic waste collection point according to formulas (2) and (3):

[0021] V ave =Q / D ave A 3 (2);

[0022] V max =KV ave (3);

[0023] in,

[0024] V ave It indicates the average daily volume of garbage discharged, in cubic meters per day;

[0025] Q represents the daily discharge weight of garbage, in tons / day;

[0026] D ave It indicates the average density of garbage in tons / cubic meter;

[0027] A 3 represents the coefficient of variation of garbage density, A 3 =0.7-0.9;

[0028] V max It indicates the maximum volume of garbage discharged during peak hours, in cubic meters per day;

[0029] K represents the coefficient of variation of daily discharge volume during peak hours of garbage, K = 1.4-1.6;

[0030] Step 133, calculating the average and maximum number of garbage containers required to be set at the domestic garbage collection points according to formulas (4) and (5);

[0031] N ave =A 4 ×V ave / EB (4)

[0032] N max =A 4 ×V max / EB (5)

[0033] in,

[0034] N ave Indicates the average number of garbage containers required to be set up;

[0035] A 4 Indicates the garbage removal cycle, in days / times;

[0036] V ave It indicates the average daily volume of garbage discharged, in cubic meters per day;

[0037] E represents the volume of a single garbage container, in cubic meters per container;

[0038] B represents the filling factor of the garbage container, B = 0.75-0.9;

[0039] N max Indicates the maximum number of garbage containers required during peak garbage season;

[0040] V max It indicates the maximum volume of garbage discharged during peak hours, in cubic meters per day;

[0041] Step 134 , selecting a value between the average value and the maximum value of the number of garbage containers as the number of garbage containers required to be set at the domestic garbage collection point.

[0042] Furthermore, in the method for selecting a site for a garbage disposal point in a village provided by the present invention, the method for determining the selectable site for each road network area according to the number of garbage containers in step 140 includes:

[0043] Step 141, dividing each road grid area into a k×k secondary grid matrix, wherein each intersection point in the secondary grid matrix is ​​a selectable address point, and obtaining a set of selectable address points, wherein k is a positive integer;

[0044] Step 142, determining whether the optional site point in the optional site point set is located within a river, road, green space, mountain or cultivated land, and if so, removing the optional site point from the optional site point set;

[0045] Step 143, for each individual building in the road grid area, calculate the minimum circle that completely covers the individual building, set the prohibited placement distance outside the minimum circle, and define the addressable points within the minimum circle and within the prohibited placement distance, as well as the addressable points where the angle between the addressable points and the building orientation is less than the building angle limit, as the unavailable addressable range, and remove the addressable points within the unavailable addressable range from the addressable point set.

[0046] Furthermore, in the method for selecting a location for garbage disposal points in a village provided by the present invention, the method for calculating the optimal solution for the distribution of the selectable locations of garbage containers in each road grid area by using a simulated annealing algorithm in step 150 includes:

[0047] Step 151, setting the initial temperature for starting annealing;

[0048] Step 152: randomly select N from the set of selectable locations. i A selectable location point as the current solution;

[0049] Step 153, calculate the current solution to obtain the objective function (6) when the garbage disposal point is close to the building and the objective function (7) when the building is far away from the garbage disposal point:

[0050]

[0051]

[0052] in,

[0053] StreetDistance represents the objective function value of the garbage disposal point being close to the building;

[0054] D hm represents the shortest garbage delivery distance from building h to the nearest candidate optional site m;

[0055] InfluenceDistance represents the objective function value of the distance between the building and the garbage disposal point;

[0056] L hm Indicates the garbage impact distance;

[0057] M i is a set of optional address points;

[0058] m is an optional address point;

[0059] H i For building collection;

[0060] h is the building;

[0061] Step 154, select a new optional point near the optional point in the optional point set of the current solution as the new solution, wherein the selected several optional points near the optional point of the current solution are called neighborhood optional points. According to the objective function (6) and the objective function (7), the new objective function value of the garbage disposal point close to the building and the new objective function value of the building far from the garbage disposal point are calculated respectively; if the new objective function value of the garbage disposal point close to the building of the new solution is better than the old objective function value of the garbage disposal point close to the building of the previous solution and the new objective function value of the building far from the garbage disposal point of the new solution is better than the old objective function value of the building far from the garbage disposal point of the previous solution, then the optional point of the new solution is accepted as the garbage disposal point; if the two new objective function values ​​of the new solution are not better than the old objective function values, then the new solution is accepted with a certain probability according to the acceptance criterion.

[0062] Step 155, at the current temperature, determine whether the number of iterations has been reached; if not, repeat step 154; if it has been reached, execute step 156;

[0063] Step 156, determine whether the output conditions are met; determine whether the current temperature reaches the termination temperature, or the total number of iterations exceeds the upper limit. If so, output the solution set of the current solution, and the optional address point position corresponding to the solution set is the optimal solution of the optional address point distribution. Otherwise, cool down, reset the number of iterations, and re-execute step 155.

[0064] Furthermore, in the method for selecting a garbage disposal point in a village provided by the present invention, the garbage disposal point is close to the shortest garbage disposal distance D from the building to the nearest candidate optional site in the objective function (6) of the building. hm is obtained through formula (61):

[0065] D hm =|(x m -x h )|+|(y m -y h )| (61);

[0066] Among them, D hm The shortest garbage delivery distance from the building to the nearest candidate site;

[0067] x m ,y m Indicates the coordinate position of the candidate optional location point;

[0068] x h ,y h Indicates the center coordinate position of the building.

[0069] Furthermore, in the method for selecting a garbage disposal point in a village provided by the present invention, the garbage impact distance in formula (7) is obtained by formula (71):

[0070]

[0071] Among them, L hm For garbage impact distance;

[0072] d is the Euclidean distance between the candidate site and the building;

[0073] α is the angle between the direction vector from the building center to the candidate garbage location and the building orientation vector;

[0074] α limit is the building angle limit;

[0075] a and b are constant coefficients;

[0076] After the value of d is determined, (-ad 2 +bd) has an overall value range of 0.2 to 0.8.

[0077] Furthermore, in the method for selecting a garbage disposal point in a village provided by the present invention, the Euclidean distance between the candidate selectable site and the building in formula (71) is obtained by formula (72):

[0078]

[0079] in,

[0080] d is the Euclidean distance between the candidate site and the building;

[0081] x m ,y m Indicates the coordinate position of the candidate addressable point m;

[0082] x h ,y h Indicates the center coordinate position of building h.

[0083] Furthermore, the method for selecting a location for a garbage disposal point in a village provided by the present invention further includes: normalizing the objective functions (6) and (7) of the output solution set in step 156 to obtain formula (8), and obtaining the overall optimal location scheme for the garbage disposal point according to the weights of the two objective functions:

[0084] Result = α 1 *StreetDistance+α 2 *InfluenceDistance (8);

[0085] in,

[0086] α 1 , α 2 is the weight;

[0087] Result represents the value of the overall optimal location of the garbage disposal point.

[0088] Furthermore, the method for selecting a site for garbage disposal points in a village provided by the present invention solves the overall optimal site selection plan for the garbage disposal points in each road grid area, thereby achieving full coverage of the optimal distribution of garbage disposal points in the entire village.

[0089] Furthermore, the method for selecting a site for garbage disposal points in a village provided by the present invention loads the garbage disposal points corresponding to the overall optimal site selection plan for garbage disposal points in the entire village onto an oblique photographic map to form an optimal distribution map of garbage disposal points.

[0090] Compared with the prior art, the present invention has the following beneficial effects:

[0091] The method for selecting a garbage disposal point in a village provided by the present invention extracts the outline, road and building information of the village where the garbage disposal point is to be set up through an oblique photographic map; then divides a plurality of road network areas with the roads and village outlines as boundaries, calculates the number of garbage containers in each road grid area, and selects candidate selectable site points equal to the number of garbage containers as a solution set after excluding unselectable site points in the selectable site point set of the road grid area according to the number of garbage containers in each road grid area, and then obtains the objective function of the garbage disposal point being close to the building and the building being far away from the garbage disposal point, and selects other garbage disposal points as new solutions until the selectable site points of the objective function value are optimally distributed, and the garbage disposal point selection is determined as the optimal solution, and the objective function in the solution set of the optimal solution is weightedly scored to obtain the optimal overall site selection plan for the garbage disposal point, so that a reasonable balance point can be quickly and efficiently found between the garbage disposal point being close to the building and the building being far away from the garbage disposal point to set up the garbage disposal point, and garbage containers such as garbage cans and garbage bins are arranged, while achieving the convenience of villagers in disposing of garbage and the odor and other toxic and harmful gases or substances generated by the garbage not affecting the villagers' lives and health.

[0092] The method for selecting a site for garbage disposal points in villages provided by the present invention provides an optimal solution for the layout of garbage containers for village public facility management, and arranges garbage containers in more reasonable locations to help village managers improve the management and placement of rural public facilities. BRIEF DESCRIPTION OF THE DRAWINGS

[0093] Figure 1 It is a schematic diagram of the structure of the village divided into road grid areas;

[0094] Figure 2 It is a structural diagram of the unselectable address range of a building unit. DETAILED DESCRIPTION

[0095] The present invention is described in detail below in conjunction with the accompanying drawings: The advantages and features of the present invention will become more apparent from the following description. It should be noted that the accompanying drawings are in very simplified form and in non-precise proportions, and are only used to conveniently and clearly assist in explaining the purpose of the embodiments of the present invention.

[0096] Please refer to Figure 1 to Figure 2 The embodiment of the present invention provides a method for selecting a location for a garbage disposal point in a village, comprising the following steps:

[0097] Step 110, extract information from the oblique photographic map of the village where the garbage disposal point is to be set up. Specifically:

[0098] The outline, building and road information of the village are extracted and stored; the building information includes at least the building outline and building orientation, and the building information may also include the building type; the information storage may be classified. The oblique photography map of the village may be obtained by taking oblique photos of the village on site, or an existing oblique photography map may be used. The oblique photography map can reflect the three-dimensional picture of the village, which is convenient for directly observing whether the layout of the garbage disposal point is appropriate.

[0099] Step 120, please refer to Figure 1 , divide the road grid area. Specifically:

[0100] The village is divided into multiple road grid areas according to the village outline and roads, and the location of garbage disposal points is selected for each road grid area; the road grid area is represented by G i Indicates that the buildings contained in the road grid area are represented by the building set H i Steps 110 and 120 decompose the entire village to perform individual processing on each road grid area to avoid excessive computation.

[0101] Step 130, determining the number of garbage containers required for each road network area, wherein the garbage containers may be garbage cans or garbage bins.

[0102] Input the population R, average daily per capita garbage production C, garbage container volume E, garbage container cleaning cycle and other parameters of the road grid area to automatically calculate the number of garbage containers N required in the area. i The specific steps are as follows:

[0103] Step 131, calculate the daily discharge weight of domestic waste within the collection range of the domestic waste collection point according to formula (1):

[0104] Q=A 1 A 2 RC (1);

[0105] in,

[0106] Q represents the daily discharge weight of garbage, in tons / day;

[0107] A 1 Indicates the daily discharge weight unevenness coefficient of garbage, A 1 =1.1-1.5;

[0108] A 2 represents the coefficient of change of resident population, A 2 =1.02-1.05;

[0109] R represents the planned population within the collection scope, in persons;

[0110] C represents the predicted daily per capita garbage discharge weight, in tons / person / day.

[0111] Step 132, according to formula (2) and (3) combined with formula (1), calculate the daily discharge volume of domestic waste within the collection range of the domestic waste collection point:

[0112] V ave =Q / D ave A 3 (2);

[0113] V max =KV ave (3);

[0114] in,

[0115] V ave It indicates the average daily volume of garbage discharged, in cubic meters per day;

[0116] A 3 represents the coefficient of variation of garbage density, A 3 =0.7-0.9;

[0117] D ave It indicates the average density of garbage in tons / cubic meter;

[0118] K represents the coefficient of variation of daily discharge volume during peak hours of garbage, K = 1.4-1.6;

[0119] V max It indicates the maximum volume of garbage discharged during peak hours, in cubic meters per day.

[0120] Step 133, according to formulas (4) and (5), combined with formulas (2) and (3), respectively calculate the average and maximum number of garbage containers required to be set up at the domestic garbage collection points;

[0121] N ave =A 4 ×V ave / EB (4)

[0122] N max =A 4 ×V max / EB (5)

[0123] in,

[0124] N ave Indicates the average number of garbage containers required to be set up;

[0125] E represents the volume of a single garbage container, in cubic meters per container;

[0126] B represents the filling factor of the garbage container, B = 0.75-0.9;

[0127] A 4 Indicates the garbage removal cycle, in days / times;

[0128] N max Indicates the maximum number of garbage containers required during peak garbage consumption.

[0129] Step 134 , selecting a value between the average value and the maximum value of the number of garbage containers as the number of garbage containers required to be set at the domestic garbage collection point.

[0130] For example, suppose the population of a road grid area is R = 8400, the average daily per capita garbage production is C = 2.4 catties, the volume of the garbage container is E = 240 liters, and the garbage container cleaning cycle is A. 4 = half a month, then the calculation process of the number of garbage containers required in the road grid area is:

[0131] Q=A 1 A 2 RC = 1.1 * 1.05 * 8400 * 2.4 / 2 / 1000 = 11.643 (tons);

[0132] V ave =Q / D ave A 3 =11.643 / 0.488 / 0.7=34.084 (cubic meters);

[0133] V max =KV ave =34.084*1.3=44.3 (cubic meters);

[0134] N ave =A 4 ×V ave / EB=1*34.084 / 0.12 / 0.9=316(pieces);

[0135] N max =A4 ×V max / EB=1*44.3 / 0.12 / 0.9=410.3(pcs);

[0136] Select N i = 350, 350 garbage containers are needed to accommodate the domestic garbage generated in the area on that day.

[0137] Step 140, determining the optional locations of each road network area according to the number of garbage containers. The optional locations refer to the optional garbage delivery points. Specifically, they include:

[0138] Step 141, each road grid area is divided into a k×k secondary grid matrix, where each intersection point in the secondary grid matrix is ​​a selectable address point m, and a selectable address point set M is obtained. i ={m 1 , m 2 , m 3 ...,m 2k}; k is a positive integer. The road network area is a first-level grid.

[0139] Step 142: for the optional address point set M i , determine the set of optional address points M i Is the optional site point in the set M located within the range of rivers, roads, green land, mountains, cultivated land, etc.? If so, remove the optional site point m from the optional site point set M. i The purpose is to exclude unavailable sites. The reason for excluding sites at road locations is to avoid affecting villagers’ passage, the reason for excluding sites at river locations is to solve the problem that garbage disposal points cannot be arranged for disposal, the reason for excluding sites at mountain locations is to solve the problem that it is inconvenient to dispose garbage in mountainous areas, the reason for excluding sites at cultivated land locations is to avoid occupying cultivated land used by villagers to grow crops, and the reason for excluding green land is to avoid affecting the beautification of the village.

[0140] Step 143, please refer to Figure 2 For each single building in the road grid area, calculate the minimum circle C that completely covers the single building i , set the prohibited distance d outside the minimum circle limit , let the center of the circle be P O , all the objects on the smallest circle C i Inside and anywhere to the center P O The distance is less than the prohibited distance d limit The optional location point is the minimum circle C i Within and prohibited distance d limit All optional locations within the range, and the angle between the optional location point m and the building orientation u is less than the building angle limit α limitThe addressable points are defined as the unaddressable range, and the addressable points in the unaddressable range are removed from the addressable point set M i In step 143, it is considered that the optional site point cannot be set within a certain range around a single building and the angle restriction between the optional site point and the building orientation is considered to avoid the factors that adversely affect the lives of villagers when garbage disposal points are set at the door of the building and its vicinity. The purpose of step 143 is to consider the unselectable address range of the "NIMBY effect".

[0141] Step 150, using a simulated annealing algorithm to calculate the optimal solution for the distribution of the optional locations of garbage containers in each road grid area. Specifically, it includes:

[0142] Step 151, setting the initial temperature T for starting annealing.

[0143] Step 152, select a set of selectable locations M i Randomly select N i The optional address point is used as the current solution x i ; The set of optional locations at this time is M i In order to exclude the set of unaddressable points, the subscripts are not redefined for the convenience of description.

[0144] Step 153, calculate the current solution to obtain the objective function (6) when the garbage disposal point is close to the building and the objective function (7) when the building is far away from the garbage disposal point.

[0145]

[0146] in,

[0147] StreetDistance represents the objective function value of the garbage disposal point being close to the building;

[0148] D hm represents the shortest garbage delivery distance from building h to the nearest candidate optional site m;

[0149] Where D hm The calculation of D can be done using the Manhattan distance method, that is, hm =|(x m -x h )|+|(y m -y h )|. Where x m ,y m represents the coordinate position of the candidate address point m, x h ,y h Indicates the center coordinate position of building h.

[0150] Objective function (6) considers the shortest garbage disposal distance of each candidate optional site, ensuring that all demand points (i.e. buildings) can conveniently dispose of garbage.

[0151]

[0152] in,

[0153] InfluenceDistance represents the objective function value of the distance between the building and the garbage disposal point;

[0154] L hm Indicates the garbage impact distance;

[0155] L hm Characterizes the negative impact of the trash can that may exist at the candidate site m on the building h. Obviously, the smaller the trash impact distance, the greater the negative impact. The smaller the trash impact distance, the closer the trash can site is to the villagers' building, and the greater the impact of the trash smell on the villagers' lives.

[0156] In order to improve the accuracy of the calculation, L in the above formula (7) hm The calculation formula is as follows:

[0157]

[0158] Where d is the Euclidean distance between the candidate site m and the building h;

[0159] α is the angle between the direction vector v from the center of building h to the candidate garbage optional location m and the building orientation vector u;

[0160] α limit is the building angle limit;

[0161] a and b are constant coefficients;

[0162] After the value of d is determined, (-ad 2 +bd) can take an overall value of [0.2, 0.8], that is, between 0.2 and 0.8 or other suitable values.

[0163] The garbage affects the distance L hm The calculation formula takes into account the relationship between the optional site points and the building orientation, which improves the rationality of the distribution of the optional site points.

[0164] In order to improve the calculation accuracy, d in formula (71) can be obtained by the following formula (72):

[0165]

[0166] Among them, x m ,y mrepresents the coordinate position of the candidate address point m, x h ,y h Indicates the center coordinate position of building h.

[0167] The objective function (7) of the building being far away from the garbage disposal point takes into account the garbage impact range of each candidate point. It is necessary to ensure that all garbage points are as far away from the demand point as possible to avoid the odor generated by the garbage from having an adverse impact on the lives of villagers.

[0168] Step 154, in the set of optional locations M of the current solution i A new optional location point is selected near the optional location point in as the new solution, wherein the selected several optional location points near the optional location point of the current solution are called neighborhood optional location points. According to the objective function (6) and the objective function (7), the new objective function value of the garbage disposal point close to the building and the new objective function value of the building far from the garbage disposal point are calculated respectively; if the new objective function value of the garbage disposal point close to the building in the new solution is better than the old objective function value of the garbage disposal point close to the building in the previous solution and the new objective function value of the building far from the garbage disposal point in the new solution is better than the old objective function value of the building far from the garbage disposal point in the previous solution, then the optional location point of the new solution is accepted as the garbage disposal point, and the optional location point of the previous solution is deleted, that is, all the optional location points are updated; if the two new objective function values ​​of the new solution are not better than the old objective function values, then according to the acceptance criterion (Metropolis criterion), the new solution is accepted with a certain probability, and some optional location points of the new solution are accepted as garbage disposal points, that is, some optional location points are updated.

[0169] Step 155 , at the current temperature T, determine whether the number of iterations L has been reached; if not, repeat step 154 ​​; if reached, execute step 156 .

[0170] Step 156, output condition determination. Determine whether the current temperature reaches the termination temperature, or the total number of iterations exceeds the upper limit. If yes, output the solution set of the current solution, which corresponds to the optimal solution of the optional address point distribution. Otherwise, cool down, reset the number of iterations L, and re-execute step 155.

[0171] This step 150 is to find the optimal solution for the distribution of optional sites through a simulated annealing algorithm, with the purpose of finding a reasonable balance point between the garbage disposal point being close to the building and the building being far away from the garbage disposal point to establish the garbage disposal point.

[0172] Step 160, determine the overall optimal location plan for the garbage disposal point.

[0173] For the solution set output in step 156, its objective functions (6) and (7) are normalized to obtain formula (8), the weights of the two objective functions are determined, and the two objective functions are weighted and scored to obtain the overall optimal site selection plan for the garbage disposal point.

[0174] Result = α 1 *StreetDistance+α 2 *InfluenceDistance (8)

[0175] Among them, α 1 , α 2 is the weight; Result represents the overall optimal location value of the garbage disposal point. The overall optimal location value of the garbage disposal point includes the overall optimal location of the distribution location of the garbage disposal point.

[0176] In the embodiment of the present invention, α 1 =0.5,α 2 =0.5, indicating that the garbage disposal point close to the building to achieve convenient garbage disposal and the building far away from the garbage disposal point to achieve a small garbage impact range have equally important weights.

[0177] Step 170, execute the remaining individual road grid areas separately to obtain the overall optimal location plan for the garbage disposal points in each road grid area, and achieve full coverage of the optimal distribution of garbage disposal points in the entire village.

[0178] Step 180, in order to facilitate the arrangement of garbage containers, the optimal location value of the garbage disposal point is loaded on the oblique photography map to guide village managers to arrange garbage containers such as garbage cans or garbage bins in the village according to the oblique photography map loaded with the optimal garbage disposal point.

[0179] The method for selecting a garbage disposal point in a village provided by an embodiment of the present invention extracts the outline, road and building information of the village where the garbage disposal point is to be set up through an oblique photographic map; then divides a plurality of road network areas with the roads and village outlines as boundaries, calculates the number of garbage containers in each road grid area, and selects candidate selectable locations equal to the number of garbage containers as a solution set after excluding unselectable locations in the selectable location point set of the road grid area according to the number of garbage containers in each road grid area, and then obtains the objective function of the garbage disposal point being close to the building and the building being far away from the garbage disposal point, and selects other garbage disposal points as new solutions until the selectable location points of the objective function value are optimally distributed, and the garbage disposal point selection is determined as the optimal solution, and the objective function in the solution set of the optimal solution is weightedly scored to obtain the optimal solution for the overall location selection of the garbage disposal point, so as to find a reasonable balance point between the garbage disposal point being close to the building and the building being far away from the garbage disposal point to set up the garbage disposal point, and arrange garbage containers such as garbage cans and garbage bins, while achieving the convenience of villagers in disposing of garbage and the odor and other toxic and harmful gases or substances generated by the garbage without affecting the villagers' lives and health.

[0180] The method for selecting a garbage disposal point in a village provided by the embodiment of the present invention calculates the solution set of the optimal distribution of garbage disposal points for each road grid area separately, thereby improving the computational efficiency of the algorithm.

[0181] The method for selecting a site for garbage disposal points in a village provided by an embodiment of the present invention provides a preferred solution for the layout of garbage containers for village management, and arranges the garbage containers in more reasonable locations to help village managers improve the management and placement of rural public facilities.

[0182] The present invention is not limited to the above-mentioned specific implementation modes. Obviously, the above-mentioned embodiments are only some embodiments of the embodiments of the present invention, but not all embodiments. Based on the described embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field belong to the scope of protection of the present invention. Those skilled in the art can make other levels of modifications and changes to the present invention. In this way, if these modifications and changes of the present invention fall within the scope of the claims of the present invention, the present invention is also intended to include these changes and changes.

Claims

1. A method for selecting a garbage disposal site in a village, characterized in that: include: Step 110, extracting the outline, road and building information of the village where the garbage disposal point is to be set up through the oblique photography map; Step 120, dividing the village into a plurality of road grid areas according to the village outline and road information, and the buildings contained in each road grid area form a building set; Step 130, determining the number of garbage containers required for each road network area; comprising: Step 131, calculate the daily discharge weight of domestic waste within the collection range of the domestic waste collection point according to formula (1): （1）； in, Q represents the daily discharge weight of garbage, in tons / day; A1 represents the daily discharge weight unevenness coefficient of garbage, A1=1.1-1.5; A2 represents the coefficient of change of resident population, A ２ =1.02-1.05; R represents the planned population within the collection scope, in persons; C represents the predicted daily per capita garbage discharge weight, in tons / person / day; Step 132, calculate the daily volume of domestic waste discharged within the collection range of the domestic waste collection point according to formulas (2) and (3): （2）； （3）； in, It indicates the average daily volume of garbage discharged, in cubic meters per day; Q represents the daily discharge weight of garbage, in tons / day; Indicates the average density of garbage in tons / cubic meter; A ３ represents the coefficient of variation of garbage density, A ３ =0.7-0.9; It indicates the maximum volume of garbage discharged during peak hours, in cubic meters per day; K represents the coefficient of variation of daily discharge volume during peak garbage discharge period, K = 1.4-1.6; Step 133, calculating the average and maximum number of garbage containers required to be set at the domestic garbage collection points according to formulas (4) and (5), respectively; （4）； （5）； in, Indicates the average number of garbage containers required to be set up; A4 represents the garbage removal cycle, in days / times; It indicates the average daily volume of garbage discharged, in cubic meters per day; E represents the volume of a single garbage container, in cubic meters per container; B represents the filling factor of the garbage container, B = 0.75-0.9; N max Indicates the maximum number of garbage containers required during peak garbage season; It indicates the maximum volume of garbage discharged during peak hours, in cubic meters per day; Step 134, selecting a value between the average value and the maximum value of the number of garbage containers as the number of garbage containers required to be set at the domestic garbage collection point; Step 140, determining the optional site points in each road network area according to the number of garbage containers; comprising: Step 141, divide each road grid area into k × k A secondary grid matrix, where each intersection point in the secondary grid matrix is ​​an optional address point, and a set of optional address points is obtained, where k is a positive integer; Step 142, determining whether the optional site point in the optional site point set is located within a river, road, green space, mountain or cultivated land, and if so, removing the optional site point from the optional site point set; Step 143, for each single building in the road grid area, the minimum circle that completely covers the single building is calculated, and the prohibited placement distance outside the minimum circle is set. The selectable site points within the minimum circle and within the prohibited placement distance, as well as the selectable site points whose angles with the building orientation are less than the building angle limit, are defined as the non-selectable site range, and the selectable site points within the non-selectable site range are removed from the selectable site point set; Step 150, calculating the optimal solution for the distribution of the optional locations of garbage containers in each road grid area by using a simulated annealing algorithm; comprising: Step 151, setting the initial temperature for starting annealing; Step 152: Randomly select from the set of optional locations N i A selectable location point as the current solution; Step 153, calculate the current solution to obtain the objective function (6) when the garbage disposal point is close to the building and the objective function (7) when the building is far away from the garbage disposal point: （6）； （7）； in, Indicates the objective function value of the garbage disposal point being close to the building; Indicates that from the building To the nearest candidate site The shortest garbage disposal distance; The objective function value representing the distance of the building from the garbage disposal point; Indicates the garbage impact distance; M i is a set of optional address points; For optional site points; For building collection; for architecture; Step 154, select a new optional site point near the optional site point in the optional site point set of the current solution as a new solution, wherein the selected several optional site points near the optional site point of the current solution are called neighborhood optional site points; calculate the new objective function value of the garbage disposal point close to the building and the new objective function value of the building far from the garbage disposal point according to the objective function (6) and the objective function (7) respectively; if the new objective function value of the garbage disposal point close to the building of the new solution is better than the old objective function value of the garbage disposal point close to the building of the previous solution and the new objective function value of the building far from the garbage disposal point of the new solution is better than the old objective function value of the building far from the garbage disposal point of the previous solution, then accept the optional site point of the new solution as the garbage disposal point; if the two new objective function values ​​of the new solution are not better than the old objective function values, then accept the new solution with a certain probability according to the acceptance criterion; Step 155, at the current temperature, determine whether the number of iterations has been reached; if not, repeat step 154; if it has been reached, execute step 156; Step 156, determine whether the output condition is met; determine whether the current temperature reaches the termination temperature, or the total number of iterations exceeds the upper limit. If so, output the solution set of the current solution, and the location of the optional point corresponding to the solution set is the optimal solution of the optional point distribution. Otherwise, cool down and reset the number of iterations. ， And re-execute step 155; The objective functions (6) and (7) of the output solution set in step 156 are normalized to obtain formula (8). According to the weights of the two objective functions, the overall optimal location scheme for the garbage disposal point is obtained: （8）； in, is the weight; A value representing the overall optimal location of the garbage disposal point; Step 160, determine the overall optimal location plan for the garbage disposal point.

2. The method for selecting a location for a village garbage disposal point according to claim 1, characterized in that: The shortest garbage drop distance from the building to the nearest candidate optional site in the objective function (6) of the garbage drop point close to the building is obtained through formula (61): （61）； in, The shortest garbage delivery distance from the building to the nearest candidate site; , Indicates the coordinate position of the candidate optional location point; , Indicates the center coordinate position of the building.

3. The method for selecting a location for a village garbage disposal point according to claim 1, characterized in that: The garbage impact distance in formula (7) is obtained by formula (71): （71）； in, For garbage impact distance; d is the Euclidean distance between the candidate site and the building; The angle between the direction vector from the center of the building to the candidate garbage location and the direction vector of the building; is the building angle limit; is a constant coefficient; exist After the value of is determined, The overall value range is between 0.2 and 0.

8.

4. The method for selecting a location for a village garbage disposal point according to claim 3, characterized in that: The Euclidean distance between the candidate optional site point and the building in formula (71) is obtained by formula (72): （72）； in, d is the Euclidean distance between the candidate site and the building; , Indicates candidate locations m The coordinate position of , Represents a building h The center coordinate position of .

5. The method for selecting a location for a village garbage disposal point according to claim 1, characterized in that: The overall optimal site selection plan is solved for the garbage disposal points in each road grid area to achieve full coverage of the optimal distribution of garbage disposal points in the entire village.

6. The method for selecting a location for a village garbage disposal point according to claim 5, characterized in that: The garbage disposal points corresponding to the overall optimal site selection plan for garbage disposal points in the entire village are loaded onto the oblique photography map to form an optimal distribution map of garbage disposal points.

Images