CN113919678A - Village garbage throwing point site selection method - Google Patents
Village garbage throwing point site selection method Download PDFInfo
- Publication number
- CN113919678A CN113919678A CN202111149709.4A CN202111149709A CN113919678A CN 113919678 A CN113919678 A CN 113919678A CN 202111149709 A CN202111149709 A CN 202111149709A CN 113919678 A CN113919678 A CN 113919678A
- Authority
- CN
- China
- Prior art keywords
- garbage
- point
- building
- points
- village
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 239000010813 municipal solid waste Substances 0.000 title claims abstract description 309
- 238000010187 selection method Methods 0.000 title claims abstract description 13
- 239000000126 substance Substances 0.000 claims abstract description 20
- 238000002922 simulated annealing Methods 0.000 claims abstract description 7
- 238000000034 method Methods 0.000 claims description 31
- 238000000137 annealing Methods 0.000 claims description 3
- 238000001816 cooling Methods 0.000 claims description 3
- 239000007789 gas Substances 0.000 abstract description 3
- 230000036541 health Effects 0.000 abstract description 3
- 231100000331 toxic Toxicity 0.000 abstract description 2
- 230000002588 toxic effect Effects 0.000 abstract description 2
- 238000004364 calculation method Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 5
- 238000004140 cleaning Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000284 extract Substances 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 231100000614 poison Toxicity 0.000 description 1
- 230000007096 poisonous effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Marketing (AREA)
- General Health & Medical Sciences (AREA)
- Evolutionary Computation (AREA)
- Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Computer Hardware Design (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a village garbage throwing point site selection method, which comprises the following steps: extracting the outline, road and building information of a village to be provided with a garbage throwing point through an oblique photography map; dividing the village into a plurality of road network grid areas according to the outline and the road information of the village, wherein buildings contained in each road network grid area form a building set; determining the quantity of garbage containers required by each road network area; determining selectable address points of each road network area according to the quantity of the garbage containers; calculating an optimal solution of the distribution of the addressable points of the garbage containers in each road network grid area through a simulated annealing algorithm; and determining the overall optimal site selection scheme of the garbage throwing points. The garbage throwing point can be set up by finding a reasonable balance point between the garbage throwing point close to the building and the garbage throwing point far away from the building, and meanwhile, the convenience of throwing garbage into villagers is realized, and the influence of toxic and harmful gases or substances such as smell generated by garbage on the life and life health of the villagers is avoided.
Description
Technical Field
The invention relates to the field of rural public facility management, in particular to a village garbage throwing point site selection method.
Background
In villages constructed in new rural areas or existing rural areas, garbage throwing is a daily matter for villagers to treat garbage, so that garbage containers such as garbage cans need to be arranged at garbage throwing points. The village buildings are scattered, so that the garbage throwing points are set to meet the requirements that the garbage throwing points are close to the buildings and the buildings are far away from the garbage throwing points. The garbage throwing point is close to the building, so that garbage can be conveniently thrown into villagers and the villagers cannot be influenced to pass, and the building is far away from the garbage throwing point, so that the influence on the life of the villagers in the building is avoided due to the fact that the odor emitted by the garbage does not influence the life of the villagers in the building, and the people in the affected villages in the building are prevented from moving away after the garbage can is arranged at the garbage throwing point. Therefore, a technical problem to be solved is urgently needed in the field of how to find a reasonable balance point between the situation that the garbage throwing point is close to the building and the situation that the building is far away from the garbage throwing point.
Disclosure of Invention
The invention aims to solve the technical problem of providing a village garbage throwing point address selecting method so as to solve the problem of how to find a reasonable balance point between the garbage throwing point close to a building and the garbage throwing point far away from the building to set the garbage throwing point.
In order to solve the technical problems, the technical scheme provided by the invention is as follows: a village garbage throwing point site selection method comprises the following steps:
110, extracting the outline, road and building information of a village to be provided with a garbage throwing point through an oblique photography map;
step 120, dividing the village into a plurality of road network grid areas according to the outline and the road information of the village, wherein buildings contained in each road network grid area form a building set;
step 130, determining the quantity of garbage containers required by each road network area;
step 140, determining the selectable address points of each road network area according to the quantity of the garbage containers;
step 150, calculating an optimal solution of distribution of the addressable points of the garbage containers in each road network grid area through a simulated annealing algorithm;
and step 160, determining an overall optimal site selection scheme of the garbage throwing points.
Further, in the village garbage throwing point addressing method provided by the present invention, the method for determining the number of garbage containers required by each road network area in step 130 includes:
step 131, calculating the daily discharge weight of the household garbage within the collection range of the household garbage collection point according to the formula (1):
Q＝A1A2RC (1)；
wherein the content of the first and second substances,
q represents the daily discharge weight of the garbage, and the unit is ton/day;
A1coefficient of non-uniformity of daily discharge weight of garbage, A1＝1.1-1.5；
A2Represents the coefficient of variation of the resident population, A2＝1.02-1.05；
R represents the number of planning population in the collection range and is expressed in units of people;
c represents the predicted daily discharge weight of the per-person garbage, and the unit is ton/person/day;
and 132, calculating the daily discharge volume of the household garbage within the collection range of the household garbage collection point according to the formulas (2) and (3):
Vave＝Q/DaveA3 (2)；
Vmax＝KVave (3)；
wherein the content of the first and second substances,
Vavethe average daily discharge volume of the garbage is expressed in unit of cubic meter per day;
q represents the daily discharge weight of the garbage, and the unit is ton/day;
Davethe average density of the garbage is expressed in ton/cubic meter;
A3representing the coefficient of variation of the density of the refuse, A3＝0.7-0.9；
VmaxThe unit of the maximum volume of the discharged garbage in the peak hour and day is cubic meter/day;
k represents the variation coefficient of the discharge volume of the garbage at the peak time, and K is 1.4-1.6;
step 133, respectively calculating the average value and the maximum value of the quantity of the garbage containers required to be arranged at the household garbage collection point according to the formulas (4) and (5);
Nave＝A4×Vave/EB (4)
Nmax＝A4×Vmax/EB (5)
wherein the content of the first and second substances,
Navean average value representing the number of the garbage containers required to be set;
A4representing the garbage removal period, and the unit is day/time;
Vavethe average daily discharge volume of the garbage is expressed in unit of cubic meter per day;
e represents the volume of a single garbage container, and the unit is cubic meter per garbage container;
b represents the filling coefficient of the garbage container, and B is 0.75-0.9;
Nmaxthe maximum value of the quantity of the garbage containers required to be set at the time of garbage peak is represented;
Vmaxthe unit of the maximum volume of the discharged garbage in the peak hour and day is cubic meter/day;
and 134, selecting a value between the average value and the maximum value of the quantity of the garbage containers as the quantity of the garbage containers required to be set by the household garbage collection point.
Further, in the village garbage throwing point addressing method provided by the present invention, the method for determining the addressable point of each road network area according to the number of garbage containers in step 140 includes:
step 141, dividing each road network grid area into k × k secondary grid matrixes, wherein each intersection point in the secondary grid matrixes is an addressable point to obtain an addressable point set, and k is a positive integer;
step 142, judging whether the selectable address points in the selectable address point set are located in the range of rivers, roads, green lands, mountainous regions or cultivated lands, and if so, removing the selectable address points from the selectable address point set;
step 143, calculating a minimum circle completely covering the single building in each road network grid area, setting a release prohibiting distance at the periphery of the minimum circle, defining selectable address points within the minimum circle and the release prohibiting distance, and selectable address points with an angle between the selectable address point and the building orientation smaller than a building angle limit as a non-selectable address range, and removing the selectable address points within the non-selectable address range from the selectable address point set.
Further, in the village garbage throwing point locating method provided by the present invention, the method for calculating the optimal solution of the distribution of the addressable points of the garbage containers in each road network grid area through the simulated annealing algorithm in step 150 includes:
step 151, setting an initial temperature for starting annealing;
step 152, randomly selecting N from the set of addressable pointsiThe selectable address points are used as current solutions;
step 153, calculating a current solution to obtain an objective function (6) of the garbage throwing point close to the building and an objective function (7) of the building far away from the garbage throwing point:
wherein the content of the first and second substances,
the street distance represents an objective function value of a garbage throwing point close to a building;
Dhmrepresenting the shortest garbage throwing distance from the building h to the nearest candidate addressable point m;
the influedistance represents an objective function value of the building far away from a garbage throwing point;
Lhmrepresenting a garbage impact distance;
Miis a set of addressable points;
m is an addressable point;
Hiis a building set;
h is a building;
and 154, selecting a new selectable address point near the selectable address point in the current solution as a new solution, wherein the selected several selectable address points near the selectable address point of the current solution are called neighborhood selectable address points. Respectively calculating a new objective function value of the newly solved garbage throwing point close to the building and a new objective function value of the newly solved building far away from the garbage throwing point according to the objective function (6) and the objective function (7); if the new objective function value of the garbage throwing point close to the building of the new solution is better than the old objective function value of the garbage throwing point close to the building of the previous solution and the new objective function value of the building far away from the garbage throwing point of the new solution is better than the old objective function value of the building far away from the garbage throwing point of the previous solution, the selectable address point of the new solution is accepted as the garbage throwing point; if neither of the two new objective function values of the new solution is more optimal than the old objective function value, the new solution is accepted with a certain probability according to an acceptance criterion.
Step 155, judging whether the iteration times are reached at the current temperature; if not, repeat step 154; if so, go to step 156;
step 156, determining whether the output condition is met; and judging whether the current temperature reaches the termination temperature or the total iteration frequency exceeds the upper limit, if so, outputting a solution set of the current solution, wherein the addressable point position corresponding to the solution set is the optimal solution distributed by the addressable points, otherwise, cooling, resetting the iteration frequency, and executing the step 155 again.
Further, the village garbage throwing point addressing method provided by the invention is characterized in that the garbage throwing point is close to the shortest garbage throwing distance D from a building in the objective function (6) of the building to the nearest candidate addressable pointhmObtained by the formula (61):
Dhm＝|(xm-xh)|+|(ym-yh)| (61)；
wherein D ishmThe shortest garbage throwing distance from the building to the nearest candidate addressable point is obtained;
xm、ymrepresenting the coordinate positions of the candidate addressable points;
xh、yhrepresenting the location of the building's center coordinates.
Further, according to the village garbage throwing point address selecting method provided by the invention, the garbage influence distance in the formula (7) is obtained through a formula (71):
wherein L ishmThe distance is influenced by the garbage;
d is the Euclidean distance between the candidate selectable address point and the building;
alpha is an included angle between a direction vector of the center of the building pointing to the rubbish candidate selectable point and a building orientation direction vector;
αlimitis a building angle limit value;
a. b is a constant coefficient;
after the value of d is determined, (-ad)2+ bd) has an overall value in the range of 0.2 to 0.8.
Further, in the village garbage throwing point addressing method provided by the present invention, the euclidean distance between the candidate addressable point in the formula (71) and the building is obtained by the formula (72):
wherein the content of the first and second substances,
d is the Euclidean distance between the candidate selectable address point and the building;
xm、ymrepresenting the coordinate position of the candidate addressable point m;
xh、yhindicating the location of the center coordinates of the building h.
Further, the village garbage throwing point address selecting method provided by the invention further comprises the following steps: normalizing the objective functions (6) and (7) of the solution set output in step 156 to obtain a formula (8), and obtaining an overall optimal addressing scheme of the garbage throwing points according to the weights of the two objective functions:
Result＝α1*StreetDistance+α2*InfluenceDistance (8)；
wherein the content of the first and second substances,
α1、α2is a weight;
result represents the value of the overall optimal addressing of the garbage drop points.
Further, the village garbage throwing point site selection method provided by the invention solves the overall optimal site selection scheme for the garbage throwing points of each road network grid area, and realizes the full coverage of the optimal distribution of the garbage throwing points of the whole village.
Furthermore, the village garbage throwing point site selection method provided by the invention is characterized in that garbage throwing points corresponding to the whole optimal site selection scheme of the garbage throwing points of the whole village are loaded on the oblique photography map to form an optimal garbage throwing point distribution map.
Compared with the prior art, the invention has the following beneficial effects:
the village garbage throwing point site selection method provided by the invention extracts the outline, road and building information of a village to be provided with a garbage throwing point through an oblique photographic map; then, a plurality of road network zones are divided by taking the outlines of roads and villages as boundaries, the quantity of garbage containers in each road network grid zone is calculated, candidate addressable points with the quantity equal to that of the garbage containers are selected as solution sets to obtain objective functions that the garbage throwing points are close to the building and the garbage throwing points are far away from the building according to the quantity of the garbage containers in each road network grid zone after the non-selectable addressable points are eliminated from an addressable point set of the road network grid zone, other garbage throwing points are selected as new solutions, the garbage throwing point addresses are determined to be optimal solutions until the selectable addressable points of the objective function values are optimal distribution, the objective functions in the solution sets of the optimal solutions are weighted and graded to obtain the overall optimal solution of the garbage throwing points, and therefore a reasonable balance point is quickly and efficiently found between the garbage throwing points close to the building and the garbage throwing points far away from the building to set the garbage throwing points, the garbage can is convenient for villagers to put garbage, and poisonous and harmful gases or substances such as smell generated by the garbage and the like do not influence the life and life health of the villagers.
The village garbage throwing point site selection method provided by the invention provides a preferable scheme for arranging garbage containers for village public facility management, and the garbage containers are arranged at reasonable positions so as to help village managers to improve management and throwing of village public facilities.
Drawings
FIG. 1 is a schematic diagram of a village divided into road network grid sections;
fig. 2 is a schematic structural diagram of a non-addressable range of a building unit.
Detailed Description
The invention is described in detail below with reference to the attached drawing figures: the advantages and features of the present invention will become more apparent from the following description. It is to be noted that the drawings are in a very simplified form and are not to precise scale, which is merely for the purpose of facilitating and distinctly claiming the embodiments of the present invention.
Referring to fig. 1 to 2, an embodiment of the present invention provides a village garbage throw-in point addressing method, including the following steps:
and step 110, extracting information of the oblique photography map of the village to be provided with the garbage throwing point. The method specifically comprises the following steps:
extracting and storing the contour, building and road information of the village; the building information at least comprises a building outline and a building orientation, and the building information can also comprise a building type; wherein the information store may be sorted. The oblique photography map of the village can be obtained by performing on-site oblique photography on the village, and an existing oblique photography map can also be used. The oblique photography map can reflect the three-dimensional overall view of the village, and is convenient for directly observing whether the arrangement position of the garbage throwing point is proper or not.
Step 120, please refer to fig. 1, to divide the road network grid area. The method specifically comprises the following steps:
dividing the village into a plurality of road network grid areas according to the outline and the road of the village, and selecting the site of a garbage throwing point for each road network grid area; wherein G is used for road network grid sectioniRepresenting a building set H contained in a road network gridiAnd (4) showing. Step 110 and step 120 realize the decomposition of the whole village, so that each road grid is processed in a single way, and the excessive calculation amount is avoided.
Step 130, determining the number of garbage containers required by each road network area. Wherein the garbage container can be a garbage can or a garbage can and the like.
Inputting parameters such as population R, average daily per-capita garbage yield C, garbage container volume E, garbage container cleaning period and the like of a road network grid area, and automatically calculating the number N of the garbage containers required by the areai. The method comprises the following specific steps:
step 131, calculating the daily discharge weight of the household garbage within the collection range of the household garbage collection point according to the formula (1):
Q＝A1A2RC (1)；
wherein the content of the first and second substances,
q represents the daily discharge weight of the garbage, and the unit is ton/day;
A1coefficient of non-uniformity of daily discharge weight of garbage, A1＝1.1-1.5；
A2Represents the coefficient of variation of the resident population, A2＝1.02-1.05；
R represents the number of planning population in the collection range and is expressed in units of people;
and C represents the predicted daily discharge weight of the per-person garbage, and the unit is ton/person/day.
And 132, calculating the daily discharge volume of the household garbage within the collection range of the household garbage collection point according to the formulas (2) and (3) and by combining the formula (1):
Vave＝Q/DaveA3 (2)；
Vmax＝KVave (3)；
wherein the content of the first and second substances,
Vavethe average daily discharge volume of the garbage is expressed in unit of cubic meter per day;
A3representing the coefficient of variation of the density of the refuse, A3＝0.7-0.9；
DaveThe average density of the garbage is expressed in ton/cubic meter;
k represents the variation coefficient of the discharge volume of the garbage at the peak time, and K is 1.4-1.6;
Vmaxthe unit of the maximum volume of the garbage discharged in the peak time is cubic meter per day.
Step 133, respectively calculating the average value and the maximum value of the number of the garbage containers required to be arranged at the household garbage collection point according to the formulas (4) and (5) and the combined formulas (2) and (3);
Nave＝A4×Vave/EB (4)
Nmax＝A4×Vmax/EB (5)
wherein the content of the first and second substances,
Navean average value representing the number of the garbage containers required to be set;
e represents the volume of a single garbage container, and the unit is cubic meter per garbage container;
b represents the filling coefficient of the garbage container, and B is 0.75-0.9;
A4representing the garbage removal period, and the unit is day/time;
Nmaxthe maximum value of the number of the garbage containers required to be set at the time of garbage peak is shown.
And 134, selecting a value between the average value and the maximum value of the quantity of the garbage containers as the quantity of the garbage containers required to be set by the household garbage collection point.
For example: suppose that the population R of a certain road network grid area is 8400 people, the average daily per-person garbage yield C is 2.4 jin, and the garbage capacity isVolume E of the device is 240 liters, and the cleaning period a of the garbage container4And if the road network grid area is half a month, the calculation process of the number of the garbage containers required by the road network grid area is as follows:
Q＝A1A2RC 1.1 × 1.05 × 8400 × 2.4/2/1000 ═ 11.643 (ton);
Vave＝Q/DaveA311.643/0.488/0.7 ═ 34.084 (cubic meters);
Vmax＝KVave34.084 × 1.3 × 44.3 (cubic meters);
Nave＝A4×Vave(vii)/EB 1 × 34.084/0.12/0.9 ═ 316 (counts);
Nmax＝A4×Vmax(iii) EB 410.3 (pieces) by 1 × 44.3/0.12/0.9;
selecting Ni350, 350 garbage containers are needed to contain the domestic garbage generated in the area on the day.
Step 140, determining the addressable point of each road network area according to the number of the garbage containers. Wherein the addressable point is a garbage throwing point which can be addressed. The method specifically comprises the following steps:
step 141, dividing each road network grid area into k × k secondary grid matrixes, wherein each intersection point in the secondary grid matrixes is an addressable point M, and obtaining an addressable point set Mi＝{m1，m2，m3...，m2k}; wherein k is a positive integer. Wherein the road network area is a primary grid.
Step 142, for the addressable point set MiJudging the addressable point set MiWhether the selectable address point M is located in the range of rivers, roads, green lands, mountainous regions, cultivated lands and the like, and if so, selecting the selectable address point M from a selectable address point set MiIs removed. The purpose is to exclude non-addressable points. The selectable address points at the positions of the roads are excluded so as not to influence the passing of villagers, the selectable address points at the positions of the rivers are excluded so as to solve the problem that the purpose of arranging garbage throwing points for throwing cannot be realized, the selectable address points at the positions of mountains are excluded so as to solve the problem that the mountains are inconvenient to throw, and the selectable address points at the positions of cultivated lands are excluded so as not to occupy villagersThe method is used for planting agricultural crops, and the green land is removed to beautify the environment without influencing villages.
Step 143, referring to fig. 2, for the single buildings in each road network grid area, calculating the minimum circle C completely covering the single buildingiSetting a throw-in prohibition distance d outside the minimum circlelimitSetting the center of the circle POAll are located at the smallest circle CiInside and optionally to the center of a circle POIs less than the throw-in prohibition distance dlimitAt the addressable point of (C), i.e. at the smallest circle CiInner and forbidden distance dlimitAll addressable points within, and the angle between addressable point m and building orientation u is less than building angle limit αlimitAll the addressable points of (1) are defined as the non-addressable range, and the addressable points in the non-addressable range are selected from the addressable point set MiIs removed. In the step 143, the problem that the selectable address point cannot be arranged in a certain range around the single building and the problem of angle limitation between the selectable address point and the building direction are considered, so that the problem that the garbage throwing point is arranged at the building doorway and the vicinity of the building doorway to cause adverse influence on the lives of villagers is avoided. The purpose of step 143 is to account for the range of unselected addresses for the "proximity effect".
And 150, calculating the optimal solution of the distribution of the addressable points of the garbage containers in each road network grid area by adopting a simulated annealing algorithm. The method specifically comprises the following steps:
in step 151, an initial temperature T at which annealing is started is set.
Step 152, from the set of addressable points MiIn randomly selecting NiSeveral selectable address points as current solution xi(ii) a Addressable point set M at this timeiTo exclude the set of non-addressable points, the subscript is not redefined for ease of description.
And 153, calculating the current solution to obtain an objective function (6) of the garbage throwing point close to the building and an objective function (7) of the building far away from the garbage throwing point.
Wherein the content of the first and second substances,
the street distance represents an objective function value of a garbage throwing point close to a building;
Dhmrepresenting the shortest garbage throwing distance from the building h to the nearest candidate addressable point m;
wherein DhmCan be calculated by the Manhattan distance method, i.e. Dhm＝|(xm-xh)|+|(ym-yh) L. Wherein xm、ymRepresenting the coordinate position, x, of the candidate addressable point mh、yhIndicating the location of the center coordinates of the building h.
The objective function (6) considers the shortest garbage throwing distance of each candidate addressable point, and all demand points (namely buildings) need to be guaranteed to be capable of conveniently throwing garbage.
Wherein the content of the first and second substances,
the influedistance represents an objective function value of the building far away from a garbage throwing point;
Lhmrepresenting a garbage impact distance;
Lhmand (5) characterizing the negative influence of the garbage can possibly existing in the candidate addressable point m on the building h. Clearly, a smaller distance of influence of the waste indicates a greater negative effect. The smaller the influence distance of the garbage is, the closer the site selection point of the garbage can is to the villager building is, and the larger the influence of the odor of the garbage on the villager life is.
In order to improve the accuracy of the calculation, L in the above formula (7)hmThe calculation formula of (a) is as follows:
wherein d is the Euclidean distance between the candidate addressable point m and the building h;
alpha is an included angle between a direction vector v of the center of the building h pointing to the rubbish candidate selectable place m and a building orientation direction vector u;
αlimitis a building angle limit value;
a. b is a constant coefficient;
after the value of d is determined, (-ad)2+ bd) may have an overall value of [0.2, 0.8]I.e. between 0.2 and 0.8 or other suitable values.
The garbage influence distance LhmThe calculation formula considers the correlation between the selectable address points and the building orientation, and improves the rationality of the distribution of the selectable address points.
In order to improve the calculation accuracy, d in the formula (71) can be obtained by the following formula (72):
wherein x ism、ymRepresenting the coordinate position, x, of the candidate addressable point mh、yhIndicating the location of the center coordinates of the building h.
The building is far away from an objective function (7) of a garbage putting point, the garbage influence range of each candidate point is considered, all garbage points are guaranteed to be far away from demand points as far as possible, and bad influence on village life caused by odor generated by garbage is avoided.
Step 154, at the current solution, the set of addressable points MiA new selectable address point is selected as a new solution near the selectable address point in the current solution, wherein several selectable address points selected near the selectable address point of the current solution are called neighborhood selectable address points. Respectively calculating a new objective function value of the newly solved garbage throwing point close to the building and a new objective function value of the newly solved building far away from the garbage throwing point according to the objective function (6) and the objective function (7); if the new objective function value of the newly solved garbage throwing point close to the building is better than the old objective function value of the garbage throwing point close to the building of the previous solution and the new objective function value of the newly solved building far away from the garbage throwing point is better than the old objective function value of the previously solved building far away from the garbage throwing point, the selectable address point of the new solution is accepted as the garbage throwing point, and the selectable address points of the previous solution are deleted, namely the selectable address points are updated completely; if new solution is obtainedAnd if the two new objective function values are not more optimal than the old objective function values, accepting the new solution with a certain probability according to an acceptance criterion (Metropolis criterion), and taking the part of the addressable points accepting the new solution as garbage throwing points, namely partially updating the addressable points.
Step 155, judging whether the iteration frequency L is reached or not at the current temperature T; if not, repeat step 154; if so, step 156 is performed.
Step 156, output condition compliance determination. And judging whether the current temperature reaches the termination temperature or not, or whether the total iteration number exceeds the upper limit. If so, outputting the solution set of the current solution and the optimal solution of the selectable address point distribution corresponding to the solution set, otherwise, cooling, resetting the iteration times L, and re-executing the step 155.
In step 150, the optimal solution of the distribution of the selectable sites is obtained through the simulated annealing algorithm, so that: and a reasonable balance point is searched between the situation that the garbage throwing point is close to the building and the situation that the building is far away from the garbage throwing point, and the garbage throwing point is set.
And step 160, determining an overall optimal site selection scheme of the garbage throwing points.
And (5) normalizing the solution set output in the step 156 by the objective functions (6) and (7) to obtain a formula (8), determining the weights of the two objective functions, and performing weighted scoring on the two objective functions to obtain an overall optimal site selection scheme of the garbage throwing points.
Result＝α1*StreetDistance+α2*InfluenceDistance (8)
Wherein alpha is1、α2Is a weight; result represents the overall optimal addressing value of the garbage throwing point. The overall optimal site selection value of the garbage throwing points comprises the overall optimal site selection position of the distribution positions of the garbage throwing points.
In the examples of the present invention, α is taken1＝0.5，α20.5, it puts in the convenience and keeps away from rubbish and puts in that the rubbish influence scope is little to show that rubbish is put in the point and is close to the building and realize rubbish and have equal important weight.
And 170, executing the rest single road network grid areas respectively to obtain an overall optimal site selection scheme of the garbage throwing points of each road network grid area, and realizing the full coverage of the optimal distribution of the garbage throwing points of the whole village.
Step 180, in order to facilitate the arrangement of the garbage containers, the optimal address value position of the garbage throwing point is loaded on the oblique photography map, so that the village manager can be guided to arrange the garbage containers such as garbage cans or garbage bins in the villages according to the oblique photography map loaded with the optimal garbage throwing point.
The village garbage throwing point site selection method provided by the embodiment of the invention extracts the outline, road and building information of a village to be provided with a garbage throwing point through an oblique photographic map; dividing a plurality of road network regions by taking the outlines of roads and villages as boundaries, calculating the quantity of garbage containers in each road network grid region, selecting candidate addressable points with the quantity equal to that of the garbage containers as solution sets to obtain target functions of the garbage throwing points close to the buildings and the garbage throwing points far away from the buildings according to the quantity of the garbage containers in each road network grid region after the non-addressable points are eliminated from the selectable addressable point sets of the road network grid regions, selecting other garbage throwing points as new solutions until the selectable addressable points of the target function values are optimal in distribution to determine the garbage throwing point addresses as optimal solutions, and conducting weighting scoring on the target functions in the solution sets of the optimal solutions to obtain the overall optimal solution of the garbage throwing points, so that a reasonable balance point can be found between the garbage throwing points close to the buildings and the garbage throwing points far away from the buildings to set up the garbage throwing points, garbage cans are arranged, and garbage cans are arranged, Garbage containers such as a garbage can and the like can be used for realizing convenience in putting garbage into villagers, and simultaneously, toxic and harmful gases or substances such as smell generated by the garbage and the like can not affect the life and life health of the villagers.
According to the village garbage throwing point address selecting method provided by the embodiment of the invention, the solution set of optimal distribution of garbage throwing points is independently solved for each road network grid area, and the arithmetic efficiency of the algorithm is improved.
The village garbage throwing point site selection method provided by the embodiment of the invention provides a preferable scheme for arranging garbage containers for village management, and the garbage containers are arranged at reasonable positions so as to help village managers to improve management and throwing of village public facilities.
The present invention is not limited to the above-described specific embodiments, and it is apparent that the above-described embodiments are some, not all, of the embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the invention, are within the scope of the invention. Other levels of modification and variation of the present invention may be made by those skilled in the art. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims.
Claims (10)
1. A village garbage throwing point site selection method is characterized by comprising the following steps:
110, extracting the outline, road and building information of a village to be provided with a garbage throwing point through an oblique photography map;
step 120, dividing the village into a plurality of road network grid areas according to the outline and the road information of the village, wherein buildings contained in each road network grid area form a building set;
step 130, determining the quantity of garbage containers required by each road network area;
step 140, determining the selectable address points of each road network area according to the quantity of the garbage containers;
step 150, calculating an optimal solution of distribution of the addressable points of the garbage containers in each road network grid area through a simulated annealing algorithm;
and step 160, determining an overall optimal site selection scheme of the garbage throwing points.
2. The village trash drop point addressing method of claim 1, wherein said method of determining the number of trash containers required for each road network area in step 130 comprises:
step 131, calculating the daily discharge weight of the household garbage within the collection range of the household garbage collection point according to the formula (1):
Q＝A1A2RC (1)；
wherein the content of the first and second substances,
q represents the daily discharge weight of the garbage, and the unit is ton/day;
A1coefficient of non-uniformity of daily discharge weight of garbage, A1＝1.1-1.5；
A2Represents the coefficient of variation of the resident population, A2＝1.02-1.05；
R represents the number of planning population in the collection range and is expressed in units of people;
c represents the predicted daily discharge weight of the per-person garbage, and the unit is ton/person/day;
and 132, calculating the daily discharge volume of the household garbage within the collection range of the household garbage collection point according to the formulas (2) and (3):
Vave＝Q/DaveA3 (2)；
Vmax＝KVave (3)；
wherein the content of the first and second substances,
Vavethe average daily discharge volume of the garbage is expressed in unit of cubic meter per day;
q represents the daily discharge weight of the garbage, and the unit is ton/day;
Davethe average density of the garbage is expressed in ton/cubic meter;
A3representing the coefficient of variation of the density of the refuse, A3＝0.7-0.9；
VmaxThe unit of the maximum volume of the discharged garbage in the peak hour and day is cubic meter/day;
k represents the variation coefficient of the discharge volume of the garbage at the peak time, and K is 1.4-1.6;
step 133, respectively calculating the average value and the maximum value of the quantity of the garbage containers required to be arranged at the household garbage collection point according to the formulas (4) and (5);
Nave＝A4×Vave/EB (4)
Nmax＝A4×Vmax/EB (5)
wherein the content of the first and second substances,
Navean average value representing the number of the garbage containers required to be set;
A4representing the garbage removal period, and the unit is day/time;
Vavethe average daily discharge volume of the garbage is expressed in unit of cubic meter per day;
e represents the volume of a single garbage container, and the unit is cubic meter per garbage container;
b represents the filling coefficient of the garbage container, and B is 0.75-0.9;
Nmaxthe maximum value of the quantity of the garbage containers required to be set at the time of garbage peak is represented;
Vmaxthe unit of the maximum volume of the discharged garbage in the peak hour and day is cubic meter/day;
and 134, selecting a value between the average value and the maximum value of the quantity of the garbage containers as the quantity of the garbage containers required to be set by the household garbage collection point.
3. The village garbage collection point addressing method according to claim 1, wherein said method for determining the addressable point of each road network area according to the number of garbage containers in step 140 comprises:
step 141, dividing each road network grid area into k × k secondary grid matrixes, wherein each intersection point in the secondary grid matrixes is an addressable point to obtain an addressable point set, and k is a positive integer;
step 142, judging whether the selectable address points in the selectable address point set are located in the range of rivers, roads, green lands, mountainous regions or cultivated lands, and if so, removing the selectable address points from the selectable address point set;
step 143, calculating a minimum circle completely covering the single building in each road network grid area, setting a release prohibiting distance at the periphery of the minimum circle, defining selectable address points within the minimum circle and the release prohibiting distance, and selectable address points with an angle between the selectable address point and the building orientation smaller than a building angle limit as a non-selectable address range, and removing the selectable address points within the non-selectable address range from the selectable address point set.
4. The village garbage collection site selecting method according to claim 3, wherein said step 150 of calculating an optimal solution for distribution of addressable points of garbage containers in each road network grid section by means of simulated annealing comprises:
step 151, setting an initial temperature for starting annealing;
step 152, randomly selecting N from the set of addressable pointsiThe selectable address points are used as current solutions;
step 153, calculating a current solution to obtain an objective function (6) of the garbage throwing point close to the building and an objective function (7) of the building far away from the garbage throwing point:
wherein the content of the first and second substances,
the street distance represents an objective function value of a garbage throwing point close to a building;
Dhmrepresenting the shortest garbage throwing distance from the building h to the nearest candidate addressable point m;
the influedistance represents an objective function value of the building far away from a garbage throwing point;
Lhmrepresenting a garbage impact distance;
Miis a set of addressable points;
m is an addressable point;
Hiis a building set;
h is a building;
and 154, selecting a new selectable address point near the selectable address point in the current solution as a new solution, wherein the selected several selectable address points near the selectable address point of the current solution are called neighborhood selectable address points. Respectively calculating a new objective function value of the newly solved garbage throwing point close to the building and a new objective function value of the newly solved building far away from the garbage throwing point according to the objective function (6) and the objective function (7); if the new objective function value of the garbage throwing point close to the building of the new solution is better than the old objective function value of the garbage throwing point close to the building of the previous solution and the new objective function value of the building far away from the garbage throwing point of the new solution is better than the old objective function value of the building far away from the garbage throwing point of the previous solution, the selectable address point of the new solution is accepted as the garbage throwing point; if neither of the two new objective function values of the new solution is more optimal than the old objective function value, the new solution is accepted with a certain probability according to an acceptance criterion.
Step 155, judging whether the iteration times are reached at the current temperature; if not, repeat step 154; if so, go to step 156;
step 156, determining whether the output condition is met; and judging whether the current temperature reaches the termination temperature or the total iteration frequency exceeds the upper limit, if so, outputting a solution set of the current solution, wherein the addressable point position corresponding to the solution set is the optimal solution distributed by the addressable points, otherwise, cooling, resetting the iteration frequency, and executing the step 155 again.
5. The village garbage throw point addressing method according to claim 4, characterized in that the garbage throw point is close to the shortest garbage throw distance D from a building in the building's objective function (6) to the nearest candidate addressable pointhmObtained by the formula (61):
Dhm＝|(xm-xh)|+|(ym-yh)| (61)；
wherein D ishmThe shortest garbage throwing distance from the building to the nearest candidate addressable point is obtained;
xm、ymrepresenting the coordinate positions of the candidate addressable points;
xh、yhrepresenting the location of the building's center coordinates.
6. The village garbage throw point addressing method according to claim 4, wherein the garbage impact distance in formula (7) is obtained by formula (71):
wherein L ishmThe distance is influenced by the garbage;
d is the Euclidean distance between the candidate selectable address point and the building;
alpha is an included angle between a direction vector of the center of the building pointing to the rubbish candidate selectable point and a building orientation direction vector;
αlimitis a building angle limit value;
a. b is a constant coefficient;
after the value of d is determined, (-ad)2+ bd) has an overall value in the range of 0.2 to 0.8.
7. The village garbage collection site selection method according to claim 6, wherein the Euclidean distance between the candidate addressable point in the formula (71) and the building is obtained by the formula (72):
wherein the content of the first and second substances,
d is the Euclidean distance between the candidate selectable address point and the building;
xm、ymrepresenting the coordinate position of the candidate addressable point m;
xh、yhindicating the location of the center coordinates of the building h.
8. The village garbage drop point addressing method according to claim 4, further comprising: normalizing the objective functions (6) and (7) of the solution set output in step 156 to obtain a formula (8), and obtaining an overall optimal addressing scheme of the garbage throwing points according to the weights of the two objective functions:
Result＝α1*StreetDistance+α2*InfluenceDistance (8)；
wherein the content of the first and second substances,
α1、α2is a weight;
result represents the value of the overall optimal addressing of the garbage drop points.
9. The village garbage throwing point address method according to claim 8, wherein an overall optimal address scheme is solved for the garbage throwing points of each road network grid area, so that full coverage of optimal distribution of the garbage throwing points of the entire village is achieved.
10. The village garbage throwing point addressing method according to claim 9, wherein the garbage throwing points corresponding to the garbage throwing point overall optimal addressing scheme of the entire village are loaded on the oblique photographic map to form a garbage throwing point optimal distribution map.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111149709.4A CN113919678A (en) | 2021-09-29 | 2021-09-29 | Village garbage throwing point site selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111149709.4A CN113919678A (en) | 2021-09-29 | 2021-09-29 | Village garbage throwing point site selection method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113919678A true CN113919678A (en) | 2022-01-11 |
Family
ID=79236841
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111149709.4A Pending CN113919678A (en) | 2021-09-29 | 2021-09-29 | Village garbage throwing point site selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113919678A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115271190A (en) * | 2022-07-19 | 2022-11-01 | 中环洁环境有限公司 | Method and device for distributing centralized garbage recycling points |
| CN116452245A (en) * | 2023-06-15 | 2023-07-18 | 跨越速运集团有限公司 | Logistics station site selection method, device, equipment and storage medium |
-
2021
- 2021-09-29 CN CN202111149709.4A patent/CN113919678A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115271190A (en) * | 2022-07-19 | 2022-11-01 | 中环洁环境有限公司 | Method and device for distributing centralized garbage recycling points |
| CN115271190B (en) * | 2022-07-19 | 2023-05-19 | 中环洁环境有限公司 | Method and device for arranging garbage centralized recovery points |
| CN116452245A (en) * | 2023-06-15 | 2023-07-18 | 跨越速运集团有限公司 | Logistics station site selection method, device, equipment and storage medium |
| CN116452245B (en) * | 2023-06-15 | 2023-09-01 | 跨越速运集团有限公司 | Logistics station site selection method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113919678A (en) | Village garbage throwing point site selection method | |
| Ali et al. | Sanitary landfill site selection by integrating AHP and FTOPSIS with GIS: a case study of Memari Municipality, India | |
| Rossit et al. | Exact and heuristic approaches for multi-objective garbage accumulation points location in real scenarios | |
| Wu et al. | Performance evaluation of the SLEUTH model in the Shenyang metropolitan area of northeastern China | |
| CN109165771A (en) | A kind of buried bucket layout optimization method in rural garbage based on GIS network analysis | |
| CN107506433A (en) | Urban development space general layout Scene Simulation system | |
| Islam et al. | Municipal solid waste management using GIS application in Mirpur area of Dhaka city, Bangladesh | |
| Su et al. | Applying multi-criteria decision-making to improve the waste reduction policy in Taiwan | |
| Singh et al. | Optimal selection of a landfill disposal site using a modified fuzzy utility approach | |
| CN107798357A (en) | A kind of village land used reclamation planning analogy method based on KNN | |
| Kerry Turner et al. | Towards an integrated waste management strategy | |
| CN112990770A (en) | Method for selecting site of waste incineration plant based on group optimization algorithm | |
| Singh et al. | Optimal allocation of landfill disposal site: A fuzzy multi-criteria approach | |
| CN116233865B (en) | Point distribution method and system for new pollutant monitoring equipment | |
| Villa et al. | Entering rocinha: A gis approach for the improvement of solid waste management in a slum in Rio de Janeiro (Brazil) | |
| CN113962478A (en) | Urban and rural garbage yield prediction method based on spatial scale extension and data fusion | |
| Pluto-Kossakowska | Automatic detection of grey infrastructure based on VHR image | |
| Majid et al. | Mapping of solid waste generation and collection by using GIS: A case study in Depok City | |
| Johansson et al. | Large-area goshawk habitat modeling in Dixie National Forest using vegetation and elevation data | |
| CN108197134A (en) | Grouped point object automatic Synthesis algorithm under big data support | |
| Singh et al. | The Changing Face of Urbanization, Population Expansion, and its Driving Forces: a Case Study of an Indian City | |
| Gudeta et al. | Transportation Route Optimization of Municipal Solid Waste Using Network Analyst tool, Case of Jimma town, Southwestern Ethiopia | |
| CN117252745A (en) | Public service facility site selection method and device and computer equipment | |
| CN112478496B (en) | Lockable garbage classification storage device and garbage management system based on block chain | |
| Saeteros et al. | CHARACTERISTICS OF RIOBAMBA'S HOUSEHOLD SOLID WASTE GENERATION AND THE BENEFITS OF SOURCE SEPARATION. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |