CN111738624A - Region division method and system for solving supply and demand relation balance - Google Patents
Region division method and system for solving supply and demand relation balance Download PDFInfo
- Publication number
- CN111738624A CN111738624A CN202010696450.4A CN202010696450A CN111738624A CN 111738624 A CN111738624 A CN 111738624A CN 202010696450 A CN202010696450 A CN 202010696450A CN 111738624 A CN111738624 A CN 111738624A
- Authority
- CN
- China
- Prior art keywords
- supplier
- demand
- voronoi
- demander
- range
- 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.)
- Granted
Links
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
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- 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
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
Abstract
The invention discloses a region division method and a system for solving supply and demand relation balance, wherein the method comprises the steps of obtaining geographical position point data of each supplier in a region and determining the capacity limit of each supplier; summarizing the demand parties in the area, and determining the geographic position coordinate point and the demand quantity of each demand party; generating a corresponding Voronoi diagram aiming at the geographic position point of each supplier, and sequencing the Voronoi diagrams according to the longitude and latitude and the value of the selected coordinate point; determining an initial boundary based on the well-ordered Voronoi graph, and judging through superposition analysis: when the total quantity of the demands of the demand side is larger than or equal to the capacity limit of the supply side, the demand side is distributed; if the distribution cannot be carried out, the boundary range is divided again, and the superposition analysis of the supplier and the demander under the selected boundary range is continuously executed; removing the allocated supplier and demander, regenerating a Voronoi diagram, and allocating the demander; and if the distribution of the supplier or the demander is finished, outputting the region division result.
Description
Technical Field
The invention relates to the field of space planning and operation, in particular to a region dividing method and a region dividing system for determining supply and demand relationship balance based on a dynamic Voronoi diagram.
Background
With the pace of urbanization in China becoming faster, more and more people flow to cities, and the problem of unbalanced educational resource distribution accompanying the same becomes more and more prominent. In order to ensure the full coverage of the policy of exempting from trial and approach for entry of obligation education, education departments in various regions divide the study areas on the premise of following the overall goal of 'school division and enrollment, and biographies and approach to study nearby'. At present, the primary and secondary school districts are divided mainly by single-chip division and multi-chip division, but the division of the school districts is a very complicated process. Before division of the school district, the education department needs to fully master the demands and supplies in the district, master the number of household registers and students in the district, master the number of graduation classes and classrooms of each school in the district, and comprehensively consider the school position, traffic factors and the like so as to determine a reasonable enrollment range and an enrollment plan. This process is time, labor and material intensive.
In recent years, scholars at home and abroad make a great deal of research on the division method of the school district so as to improve the division efficiency of the school district. The methods mainly focus on a mathematical model method, a GIS division method and a heuristic algorithm optimization method, but many methods only play a certain auxiliary role, and none of the methods can be directly put into practical application. The mathematical model method is either simple data statistics comparison, which cannot consider the problem of spatial layout, or belongs to the problem of NP-Hard, which is difficult to obtain a stable effective solution. The GIS division method mainly comprises a buffer area analysis method, a Thiessen polygon division method, a road network distance analysis method and the like, and mainly focuses on the distance problem. Buffer analysis can take into account the distance coverage problem to some extent, but it is difficult to form a continuous space; although the Thiessen polygon method can cover all the space, the problem of supply and demand balance cannot be solved; the road network distance method can take actual traffic conditions into consideration and minimize traffic cost, but is difficult to take into account the contradiction between supply and demand. Therefore, the school district division method needs to be further optimized, and the distance problem and the supply and demand balance problem are considered comprehensively.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a region division method and system for solving the problem of supply and demand balance in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: a region division method for solving supply and demand relation balance is constructed, and the method comprises the following steps:
s1, acquiring geographical location point data of each supplier in the area, and determining the capacity limit of each supplier according to the number of persons that can be accommodated by each supplier;
s2, summarizing the demanders in the area, and determining the geographic position coordinate point and the demand quantity of each demander;
s3, generating a corresponding Voronoi diagram aiming at the geographical position point of each supplier; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates;
s4, based on the sequenced Voronoi diagrams, taking the Voronoi diagram at the lower left corner as an initial boundary, after a supplier and a plurality of demanders included in the diagrams are determined, respectively performing superposition analysis on the current Voronoi diagram, the supplier and each demander, and judging whether the total quantity of the demands of the demanders is greater than or equal to the capacity limit of the supplier or not; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed;
s5, removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographical location points of the rest suppliers, and repeating the steps S4-S5; and when the supplier or the demander is completely distributed, outputting the region division result.
The invention discloses a region division system for solving supply and demand relation balance, which comprises the following units:
a first data acquisition unit for acquiring geographical location point data of each supplier in the area, and determining a capacity limit of each supplier by the number of persons that can be accommodated by each supplier;
the second data acquisition unit is used for summarizing the demanders in the area and determining the geographic position coordinate point and the demand quantity of each demander;
a Voronoi diagram generation unit, which is used for generating corresponding Voronoi diagrams for the geographical position points of each supplier; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates;
the superposition analysis unit is used for taking the Voronoi diagram at the lower left corner as an initial boundary based on the sequenced Voronoi diagrams, respectively carrying out superposition analysis on the current Voronoi diagram, the supplier and each supplier after determining the supplier and a plurality of demanders in the diagrams, and judging whether the total quantity of the demands of the demanders is more than or equal to the capacity limit of the supplier or not; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed;
the output unit is used for removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographic position points of the rest suppliers, and performing superposition analysis of the suppliers and the demanders in the Voronoi diagrams by associating the Voronoi diagrams with the superposition analysis unit to complete the distribution of the demanders; and when the supplier or the demander finishes the distribution, outputting the region division result.
The beneficial effects of the area dividing method and the area dividing system for solving the supply and demand relation balance are as follows: on one hand, the plane is divided by utilizing the traditional Voronoi diagram, the disadvantage that the boundary range can not be accurately constrained by utilizing the non-spatial attribute of the point set is overcome, and the region is dynamically planned according to the capacity limit of a supplier and the total quantity of demands in a coverage range, so that the supply and demand balance is kept, and the optimal distribution effect is achieved. On the other hand, the distribution process is highly intelligent and automatic, the working efficiency is improved, and the cost of administrative decision is reduced.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow chart of a region partitioning method for resolving supply-demand balance according to the present invention;
fig. 2 is a schematic structural diagram of a region partitioning system for solving supply-demand relationship balance according to the present invention.
Detailed Description
For a more clear understanding of the technical features, objects and effects of the present invention, embodiments of the present invention will now be described in detail with reference to the accompanying drawings.
Please refer to fig. 1, which is a flowchart illustrating a method for partitioning a region to solve a supply-demand relationship balance according to the present invention, wherein the method for partitioning a region to solve a supply-demand relationship balance disclosed in the present invention comprises the following steps:
s1, acquiring geographical location point data of each supplier in the area, and determining the capacity limit of each supplier according to the number of persons that can be accommodated by each supplier;
if a school is taken as a supplier and a student unit is taken as a demander, it should be noted that the current steps can be further understood as follows: location point data for each school is obtained and associated with the number of people accommodated by each school. Wherein: the student unit may refer to a community grid, a community, a building, a community, or the like, for example, in a subsequent execution process, the number of students included in one community grid may be counted, and then each community grid may be assigned to a corresponding school according to a capacity limit of the school. The student unit may also refer to a cell, for example, in a subsequent execution process, cell data of one region is obtained through statistics, and each cell corresponds to one student number, so that when regionalization is performed, it is determined that the cell is enough to be entirely allocated to a corresponding school according to the capacity limit of the school and the student number corresponding to the cell.
S2, summarizing the demanders in the area, and determining the geographic position coordinate point and the demand quantity of each demander;
if a school is taken as a supplier and a student unit is taken as a demander, it should be noted that the current steps can be further understood as follows: the number of students per student unit in the area is summarized, as well as the geographic location coordinate point for each student unit.
In conjunction with steps S1-S2, there is illustrated:
suppose there are m schools, and the number of students that each school can accommodate is Sxx1，Sxx2，Sxx3，...，Sxxm(ii) a Suppose there are n student units, the number of students in each student unit is Sxs1，Sxs2，Sxs3，...，Sxsn。
S3, generating a corresponding Voronoi diagram aiming at the geographical position point of each supplier; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates;
specifically, the step of taking out coordinates of corresponding points of the outsourcing rectangle, and the step of sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude of the coordinates and the value of the coordinate points includes:
calculating outsourcing rectangles of all polygons of the Voronoi graph, taking a coordinate point at the lower left corner of the outsourcing rectangle, and sequencing the generated corresponding Voronoi graphs from the west to the east and from the south to the north according to the sequence of longitude and latitude, and the value of the coordinate point from low value to high value.
For example, assuming that there are m schools, n Voronoi diagrams are generated according to the geographic location points of the suppliers in the current step; the n resulting Voronoi diagrams are sorted, that is, the Voronoi diagrams are sorted by using the coordinate points at the lower left corner of the outsourcing rectangle, which further ensures that each pair of supply and demand parties (schools) starts from the Voronoi diagram at the lower left corner.
S4, based on the sequenced Voronoi diagrams, taking the Voronoi diagram at the lower left corner as an initial boundary, after a supplier and a plurality of demanders included in the diagrams are determined, respectively performing superposition analysis on the current Voronoi diagram, the supplier and each demander, and judging whether the total quantity of the demands of the demanders is greater than or equal to the capacity limit of the supplier or not; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed;
specifically, within the range of the capacity limit of the supplier, when determining that the allocation of the demander can be completed, the method comprises the following substeps:
s41, calculating barycentric coordinates of each demand side in the Voronoi diagram, and finishing the sequencing of the multiple demand sides in the diagram according to the mode of sequencing the generated corresponding Voronoi diagram in the step S3;
s42, selecting the demand side in sequence based on the sorting result of the demand side, and accumulating the demand quantity of the selected demand side until the total quantity of the accumulated demands reaches the capacity limit of the supply side;
and S43, allocating the demand side participating in accumulation to the supply side in the polygon.
The sub-steps are further explained by the example of step S3:
firstly, taking the Voronoi graph at the leftmost lower corner as an initial boundary, starting to judge whether distribution conditions are met, and if so, sequencing the student units in the area;
secondly, determining the barycentric coordinates of each student unit in the Voronoi diagram, and sequencing the student units according to the sequencing mode of the Voronoi diagram;
and finally, performing iterative accumulation to finish the distribution of the student units.
It should be considered that, since it is generally impossible to ensure that the number of students divided in the area is exactly equal to the accommodation limit of the school, in order to ensure the execution efficiency of the algorithm, the following operations may be performed:
first, assume that there are n student units in the area, and the number of students in each student unit is Sxs1，Sxs2，Sxs3，...，Sxsn(ii) a The corresponding school accommodation limit under this figure is Sxxk；
Secondly, a floating range is set so that the number of students divided in the area is SxxkFloating left and right; for example, if the floating accuracy is set to 0.05, the floating population at the school accommodation limit is 0.05 × Sxxk(ii) a Setting the accumulated initial value of the number of students to be 0, iteratively accumulating the number of students from the first student unit according to the sorted student units, and accumulating the total quantity S of the accumulated demands, namely S=Sxx1+Sxx2+...+Sxxk；
Finally, if the inequality is satisfied:
|S-Sxxk|<=0.05*Sxxk；
the iteration stops and the student units participating in the accumulation are assigned to schools within the polygon.
Specifically, the expanding the search range on the existing boundary until finding the boundary range satisfying the condition includes:
the method comprises the steps of searching for an optimal area in a mode of gradually expanding a search range, specifically, respectively setting a first expansion range and a first search step length on the basis of the existing boundary, gradually expanding the search range according to the first search step length on the basis of the first expansion range, and stopping searching when the total quantity of demands of a demand side selected in the search range is larger than or equal to the capacity limit of a supply side.
Still taking schools as suppliers and student units as demanders at present, the above-mentioned expanding the search range on the existing boundary can be further understood as:
if all the student unit elements in the corresponding Voronoi graph cannot meet the stop condition after the iteration is finished, the fact that the total number of the student demand in the area is smaller than the accommodation limit of the school and cannot be distributed is shown, and therefore the search range needs to be expanded;
however, the range cannot be set either too small or too large at once. The search efficiency is low due to too small setting, the condition can be met only by searching for many times, and the school is too far away from the student factors due to too large setting, so that the principle of entering nearby is not facilitated;
therefore, when the search range is gradually expanded, firstly, an initial expansion range is set on the basis of the original boundary, for example, 100m is taken, then a search step is set, for example, 10m is taken as the step, the range is gradually expanded according to the step on the basis of 100m, and the search is stopped when the total number of students in the search range is larger than or equal to the accommodation limit of the school.
S5, removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographical location points of the rest suppliers, and repeating the steps S4-S5; and when the supplier or the demander is completely distributed, outputting the region division result.
Specifically, when determining whether the supplier or the demander is allocated completely, the method further includes:
when the Voronoi diagram cannot be constructed according to the geographical position points of the rest suppliers, selecting one supplier, determining the geographical position coordinate point of the supplier, searching the demanders in the area range according to a preset second expansion range and a second search step length, and calculating the total quantity of the demands;
and comparing the total quantity of the obtained demands with the capacity limit of the selected supplier, stopping searching when the distribution condition of the demander is reached, selecting the next supplier, and outputting the region division result when the distribution of the supplier or the demander is finished.
For example, when a Voronoi diagram cannot be constructed according to the geographical location points of the remaining schools, any school is selected according to a certain search radius of 1km, a buffer area range is generated by taking the coordinate point corresponding to the school as the center and taking 1km as the radius, a certain search step length is set, for example, 100 meters, and when searching for a demand side in an area range is performed, the buffer area range is searched according to a standard of expanding 100 meters every time. If the number of students in the student unit in the range is Sxs1, Sxs2,...,SxsjThen calculate the accumulated value S of the number of studentsj=Sxs1+ Sxs2+...+Sxsj. Wherein the number S of students to be accumulatedjComparing with the school capacity until the number S of the students is accumulatedjAnd stopping searching when the capacity of the school is larger than or equal to the capacity of the school. For example, compare SjAnd school accommodation range (S)xxk±0.05*Sxxk) When size of Sj>=（Sxxk±0.05*Sxxk) The search is stopped.
According to the region division method and the region division system for solving the supply and demand relation balance, on one hand, a plane is divided by utilizing a traditional Voronoi diagram, and the disadvantage that a boundary range cannot be accurately constrained by utilizing a point set non-spatial attribute is overcome, wherein region planning is dynamically carried out according to the capacity limit of a supplier and the total quantity of demands in a coverage range, so that the supply and demand balance is kept, and the optimal distribution effect is achieved; on the other hand, the distribution process is highly intelligent and automatic, the working efficiency is improved, and the cost of administrative decision is reduced. Please refer to fig. 2, which is a system for partitioning areas for solving supply-demand relationship balance disclosed in the present invention, comprising the following units:
a first data acquisition unit 10 for acquiring geographical location point data of each supplier in an area, and determining a capacity limit of each supplier by the number of persons that can be accommodated by each supplier;
the second data acquisition unit 20 is configured to collect the demanders in the area, and determine a geographic position coordinate point and a demand quantity of each demander;
a Voronoi diagram generating unit 30 for generating a corresponding Voronoi diagram for each supplier's geographic location point; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates; wherein:
the Voronoi diagram generating unit 30 includes a first sorting unit 301;
the first ordering unit 301 is configured to calculate outsourcing rectangles of all polygons of the Voronoi diagram, take a coordinate point at a lower left corner of the outsourcing rectangle, and order the generated corresponding Voronoi diagrams from a low value to a high value in an order from west to east and from south to north according to an order from longitude to latitude.
The superposition analysis unit 40 is used for taking the Voronoi diagram at the lower left corner as a starting boundary based on the sequenced Voronoi diagrams, respectively performing superposition analysis on the current Voronoi diagram, the supplier and each supplier after determining the supplier and the plurality of suppliers included in the diagrams, and judging whether the total quantity of the demands of the suppliers is more than or equal to the capacity limit of the supplier; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed; wherein:
the overlay analysis unit 40 comprises the following sub-units:
the second sorting unit 401 is configured to calculate barycentric coordinates of each of the requesters in the Voronoi diagram, and complete sorting of the plurality of requesters in the Voronoi diagram in a manner of sorting the generated corresponding Voronoi diagram;
the demand quantity accumulation unit 402 is configured to select the demand parties in sequence based on the sorting result of the demand parties, and accumulate the demand quantity of the selected demand parties until the total quantity of the accumulated demands reaches the capacity limit of the supply party;
the allocation unit 403 is used to allocate the demand parties participating in the accumulation to the supply parties within the polygon.
The expansion search unit 404 is configured to, when the allocation of the demand side cannot be completed within the range of the capacity limit of the supply side, adopt a mode of gradually expanding the search range, set a first expansion range and a first search step length on the basis of the existing boundary, gradually expand the search range according to the first search step length on the basis of the first expansion range, and stop the search when the total quantity of demands of the demand side selected within the search range is greater than or equal to the capacity limit of the supply side.
The output unit 50 is used for removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographic position points of the rest suppliers, and performing superposition analysis of the suppliers and the demanders in the Voronoi diagrams by associating the Voronoi diagrams with the superposition analysis unit to complete the distribution of the demanders; and when the supplier or the demander finishes the distribution, outputting the region division result. Wherein:
the output unit 50 includes a judging unit 501, and when the Voronoi diagram cannot be constructed according to the geographical location points of the remaining suppliers, the judging unit 501 is configured to:
selecting one supplier, searching the demanders in the area range according to a preset second expansion range and a second search step length after determining the geographic position coordinate point of the supplier, and calculating the total quantity of the demands; and comparing the total quantity of the obtained demands with the capacity limit of the selected supplier, stopping searching when the distribution condition of the demander is reached, selecting the next supplier, and outputting the region division result when the distribution of the supplier or the demander is finished.
With reference to the explanation contents of fig. 1 and fig. 2, the method and system for partitioning a region for solving the supply-demand relationship balance provided by the present invention, on one hand, partition a plane by using a traditional Voronoi diagram, overcome the disadvantage that a boundary range cannot be accurately constrained by using a point set non-spatial attribute, wherein the region is dynamically planned according to the capacity limit of a supplier and the total quantity of demands in a coverage range, thereby maintaining the supply-demand balance and achieving the optimal distribution effect; on the other hand, the distribution process is highly intelligent and automatic, the working efficiency is improved, and the cost of administrative decision is reduced.
While the present invention has been described with reference to the embodiments shown in the drawings, the present invention is not limited to the embodiments, which are illustrative and not restrictive, and it will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (10)
1. A region partition method for resolving supply-demand relationship balance, comprising the steps of:
s1, acquiring geographical location point data of each supplier in the area, and determining the capacity limit of each supplier according to the number of persons that can be accommodated by each supplier;
s2, summarizing the demanders in the area, and determining the geographic position coordinate point and the demand quantity of each demander;
s3, generating a corresponding Voronoi diagram aiming at the geographical position point of each supplier; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates;
s4, based on the sequenced Voronoi diagrams, taking the Voronoi diagram at the lower left corner as an initial boundary, after a supplier and a plurality of demanders included in the diagrams are determined, respectively performing superposition analysis on the current Voronoi diagram, the supplier and each demander, and judging whether the total quantity of the demands of the demanders is greater than or equal to the capacity limit of the supplier or not; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed;
s5, removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographical location points of the rest suppliers, and repeating the steps S4-S5; and when the supplier or the demander is completely distributed, outputting the region division result.
2. The area division method according to claim 1, wherein in step S3, the step of taking out coordinates of corresponding points of the outsourcing rectangle and sorting the generated corresponding Voronoi diagrams according to longitude and latitude and value of the coordinates specifically comprises:
calculating outsourcing rectangles of all polygons of the Voronoi graph, taking a coordinate point at the lower left corner of the outsourcing rectangle, and sequencing the generated corresponding Voronoi graphs from the west to the east and from the south to the north according to the sequence of longitude and latitude, and from the low value to the high value.
3. The area division method according to claim 1, wherein in step S4, the allocation of the demand side within the capacity limit of the supply side is specifically:
calculating barycentric coordinates of each demander in the Voronoi diagram, and finishing the sequencing of the plurality of demanders in the diagram in a mode of sequencing the generated corresponding Voronoi diagram in the step S3;
selecting the demanders in sequence based on the sequencing result of the demanders, and accumulating the demand quantity of the selected demanders until the total quantity of the accumulated demands reaches the capacity limit of the supplier;
the demand parties participating in the accumulation are assigned to the suppliers within the polygon.
4. The method for dividing regions according to claim 1, wherein in step S4, the step of expanding the search range on the existing boundary until finding a boundary range satisfying the condition is specifically as follows:
searching for an optimal area by adopting a mode of gradually expanding a search range, wherein the method comprises the following steps:
respectively setting a first expansion range and a first search step length on the basis of the existing boundary, gradually expanding the search range according to the first search step length on the basis of the first expansion range, and stopping searching when the total quantity of the demands of the selected demanders in the search range is greater than or equal to the capacity limit of the suppliers.
5. The region division method according to claim 1, wherein in step S5, in the confirming step
When the supplier or the demander is determined to be distributed completely, the method further comprises the following steps:
when the Voronoi diagram cannot be constructed according to the geographical position points of the rest suppliers, selecting one supplier, determining the geographical position coordinate point of the supplier, searching the demanders in the area range according to a preset second expansion range and a second search step length, and calculating the total quantity of the demands;
and comparing the total quantity of the obtained demands with the capacity limit of the selected supplier, stopping searching when the distribution condition of the demander is reached, selecting the next supplier, and outputting the region division result when the distribution of the supplier or the demander is finished.
6. A zone partitioning system for resolving supply-demand relationship balance, comprising the following units:
a first data acquisition unit for acquiring geographical location point data of each supplier in the area, and determining a capacity limit of each supplier by the number of persons that can be accommodated by each supplier;
the second data acquisition unit is used for summarizing the demanders in the area and determining the geographic position coordinate point and the demand quantity of each demander;
a Voronoi diagram generation unit, which is used for generating corresponding Voronoi diagrams for the geographical position points of each supplier; calculating outsourcing rectangles of all polygons of the Voronoi diagrams aiming at each obtained Voronoi diagram, taking out corresponding point coordinates of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams according to the longitude and latitude and the value of the coordinates;
the superposition analysis unit is used for taking the Voronoi diagram at the lower left corner as an initial boundary based on the sequenced Voronoi diagrams, respectively carrying out superposition analysis on the current Voronoi diagram, the supplier and each supplier after determining the supplier and a plurality of demanders in the diagrams, and judging whether the total quantity of the demands of the demanders is more than or equal to the capacity limit of the supplier or not; if yes, completing the distribution of the demand side within the capacity limit range of the supply side; if not, expanding the search range on the existing boundary until finding the boundary range meeting the conditions, and continuing to perform the superposition analysis of the supplier and the demander in the Voronoi diagram under the selected boundary range until the distribution of the demander is completed;
the output unit is used for removing the suppliers and the demanders which have participated in the distribution, regenerating corresponding Voronoi diagrams based on the geographic position points of the rest suppliers, and performing superposition analysis of the suppliers and the demanders in the Voronoi diagrams by associating the Voronoi diagrams with the superposition analysis unit to complete the distribution of the demanders; and when the supplier or the demander finishes the distribution, outputting the region division result.
7. The region division system according to claim 6, wherein the Voronoi diagram generating unit includes a first sorting unit;
the first sequencing unit is used for calculating outsourcing rectangles of all polygons of the Voronoi diagram, taking coordinate points at the lower left corner of the outsourcing rectangles, and sequencing the generated corresponding Voronoi diagrams from the west to the east and from the south to the north according to the sequence of longitude and latitude and from the low value to the high value.
8. The zone division system of claim 6, wherein the overlay analysis unit comprises the following sub-units:
the second sequencing unit is used for calculating barycentric coordinates of each demand side in the Voronoi diagram and finishing sequencing of a plurality of demand sides in the diagram in a mode of sequencing the generated corresponding Voronoi diagram;
the demand quantity accumulation unit is used for selecting the demand parties in sequence based on the sequencing result of the demand parties and accumulating the demand quantity of the selected demand parties until the total quantity of the accumulated demands reaches the capacity limit of the supply party;
and the allocation unit is used for allocating the demand party participating in accumulation to the supply party in the polygon.
9. The area division system according to claim 6, wherein the superimposition analysis unit includes an expansion search unit;
the expanding search unit is used for respectively setting a first expanding range and a first search step length on the basis of the existing boundary in a mode of gradually expanding the search range when the distribution of the demand side cannot be completed in the capacity limit range of the supply side, gradually expanding the search range according to the first search step length on the basis of the first expanding range, and stopping the search when the total quantity of the demands of the demand side selected in the search range is larger than or equal to the capacity limit of the supply side.
10. The area division system according to claim 6, further comprising a judgment unit under the output unit, when the Voronoi diagram cannot be constructed according to the geographical location points of the remaining suppliers:
selecting one supplier, searching the demanders in the area range according to a preset second expansion range and a second search step length after determining the geographic position coordinate point of the supplier, and calculating the total quantity of the demands; and comparing the total quantity of the obtained demands with the capacity limit of the selected supplier, stopping searching when the distribution condition of the demander is reached, selecting the next supplier, and outputting the region division result when the distribution of the supplier or the demander is finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010696450.4A CN111738624B (en) | 2020-07-20 | 2020-07-20 | Region division method and system for solving supply and demand relation balance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010696450.4A CN111738624B (en) | 2020-07-20 | 2020-07-20 | Region division method and system for solving supply and demand relation balance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111738624A true CN111738624A (en) | 2020-10-02 |
| CN111738624B CN111738624B (en) | 2020-11-13 |
Family
ID=72654986
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010696450.4A Active CN111738624B (en) | 2020-07-20 | 2020-07-20 | Region division method and system for solving supply and demand relation balance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111738624B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114399145A (en) * | 2021-12-02 | 2022-04-26 | 广州市城市规划勘测设计研究院 | Method and device for adjusting plot blocks |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065443A (en) * | 2010-11-29 | 2011-05-18 | 广州杰赛科技股份有限公司 | Method and device for dividing channel region |
| CN103607720A (en) * | 2013-11-12 | 2014-02-26 | 江苏省邮电规划设计院有限责任公司 | Area automatic dividing method based on station point property |
| US20140333629A1 (en) * | 2009-05-29 | 2014-11-13 | Microsoft Corporation | Generating voronoi treemaps |
| CN106503845A (en) * | 2016-10-21 | 2017-03-15 | 国网山东省电力公司烟台供电公司 | A kind of charging station method of allocation plan that is schemed based on V with HS algorithms |
| US20170251377A1 (en) * | 2014-09-25 | 2017-08-31 | Nokia Solutions And Networks Oy | Method and system for neighbor tier determination |
| CN108280175A (en) * | 2018-01-22 | 2018-07-13 | 大连大学 | The row's of the falling space index method divided based on medical services region |
| CN108875032A (en) * | 2018-06-25 | 2018-11-23 | 讯飞智元信息科技有限公司 | Area type determines method and device |
| CN109272170A (en) * | 2018-10-11 | 2019-01-25 | 北京市交通信息中心 | A kind of traffic zone dividing system based on Louvain algorithm |
| CN110135665A (en) * | 2018-02-02 | 2019-08-16 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that dynamic divides dispatching region |
| US10412544B1 (en) * | 2019-02-04 | 2019-09-10 | The Florida International University Board Of Trustees | Voronoi diagram-based algorithm for efficient progressive continuous range query for moving objects |
| KR20200022144A (en) * | 2018-08-22 | 2020-03-03 | 울산과학기술원 | System and Method for Analyzing Housing Market using Development of Emotion Dictionary |
| CN111310966A (en) * | 2019-11-21 | 2020-06-19 | 国网四川省电力公司经济技术研究院 | Micro-grid site selection and optimal configuration method containing electric vehicle charging station |
-
2020
- 2020-07-20 CN CN202010696450.4A patent/CN111738624B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140333629A1 (en) * | 2009-05-29 | 2014-11-13 | Microsoft Corporation | Generating voronoi treemaps |
| CN102065443A (en) * | 2010-11-29 | 2011-05-18 | 广州杰赛科技股份有限公司 | Method and device for dividing channel region |
| CN103607720A (en) * | 2013-11-12 | 2014-02-26 | 江苏省邮电规划设计院有限责任公司 | Area automatic dividing method based on station point property |
| US20170251377A1 (en) * | 2014-09-25 | 2017-08-31 | Nokia Solutions And Networks Oy | Method and system for neighbor tier determination |
| CN106503845A (en) * | 2016-10-21 | 2017-03-15 | 国网山东省电力公司烟台供电公司 | A kind of charging station method of allocation plan that is schemed based on V with HS algorithms |
| CN108280175A (en) * | 2018-01-22 | 2018-07-13 | 大连大学 | The row's of the falling space index method divided based on medical services region |
| CN110135665A (en) * | 2018-02-02 | 2019-08-16 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that dynamic divides dispatching region |
| CN108875032A (en) * | 2018-06-25 | 2018-11-23 | 讯飞智元信息科技有限公司 | Area type determines method and device |
| KR20200022144A (en) * | 2018-08-22 | 2020-03-03 | 울산과학기술원 | System and Method for Analyzing Housing Market using Development of Emotion Dictionary |
| CN109272170A (en) * | 2018-10-11 | 2019-01-25 | 北京市交通信息中心 | A kind of traffic zone dividing system based on Louvain algorithm |
| US10412544B1 (en) * | 2019-02-04 | 2019-09-10 | The Florida International University Board Of Trustees | Voronoi diagram-based algorithm for efficient progressive continuous range query for moving objects |
| CN111310966A (en) * | 2019-11-21 | 2020-06-19 | 国网四川省电力公司经济技术研究院 | Micro-grid site selection and optimal configuration method containing electric vehicle charging station |
Non-Patent Citations (4)
| Title |
|---|
| KWANGSOO YANG ETAL.: "Capacity-Constrained Network-Voronoi Diagram", 《2016 IEEE 32ND INTERNATIONAL CONFERENCE ON DATA ENGINEERING(ICDE)》 * |
| MICHAEL BALZER: "Capacity-Constrained Voronoi Diagrams in Continuous Spaces", 《2009 SIXTH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS》 * |
| 刘俊岭: "地震避难所选取及服务区划分研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
| 陆天琪: "基于GIS的朝阳市中心城区小学教育资源布局及优化研究", 《中国优秀硕士学位论文全文数据库 社会科学Ⅱ辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114399145A (en) * | 2021-12-02 | 2022-04-26 | 广州市城市规划勘测设计研究院 | Method and device for adjusting plot blocks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111738624B (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yeh et al. | An integrated GIS and location-allocation approach to public facilities planning—An example of open space planning | |
| CN110532337B (en) | Smart community-oriented public facility service capability improving method | |
| CN101900565A (en) | Path determining method and device | |
| CN105677804A (en) | Determination of authority stations and building method and device of authority station database | |
| CN103336894B (en) | A kind of city plot ratio automatic Mesh Partition Method | |
| CN109492950A (en) | One kind can meet big regional scope space saturation load forecasting method based on GIS technology | |
| CN109840452A (en) | A kind of grid covering scene automatic identifying method and device | |
| CN109800940A (en) | A kind of charging pile site selecting method and device | |
| CN115879737A (en) | Shared bicycle station site selection method based on density and access degree balanced clustering | |
| CN111738624B (en) | Region division method and system for solving supply and demand relation balance | |
| CN110910006B (en) | Multisource data processing method for comprehensively utilizing regional reclaimed water resources | |
| CN114219350A (en) | Intelligent site selection method and device for natural resource construction project | |
| Kurniadhini et al. | The suitability level of bike-sharing station in Yogyakarta using SMCA technique | |
| Popović et al. | An MCDM approach to tourism projects evaluation: The Upper Danube Basin case | |
| CN103942821A (en) | Method for rapidly obtaining urban land situation map sequence by remote-sensing images | |
| Agugiaro et al. | Project CI-NERGY: towards an integrated energy urban planning system from a data modelling and system architecture perspective | |
| CN110633910A (en) | Tourism highway service facility camp layout method | |
| CN115600855A (en) | GIS-based urban planning land intensity partitioning method, system and storage medium | |
| Samsudin et al. | A comparative study of smart city initiatives in Malaysia: Putrajaya and Iskandar Puteri | |
| Skarbal et al. | How to pinpoint energy-inefficient buildings? An approach based on the 3D city model of Vienna | |
| Zhou et al. | Population mobility network and spatial accessibility based on peer-to-peer interactive energy management | |
| CN111667202A (en) | Site selection method and device for electric vehicle charging station | |
| CN112434978A (en) | Efficient office room allocation method and system | |
| Hu et al. | Shared parking policy analysis based on game theory | |
| Murseli et al. | Land suitability location analysis for housing development using GIS |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 430000 Wuda science and Technology Park, Jiangxia Avenue, Miaoshan District, Donghu Development Zone, Wuhan City, Hubei Province Patentee after: Geospace Information Technology Co.,Ltd. Address before: 430000 Wuda science and Technology Park, Jiangxia Avenue, Miaoshan District, Donghu Development Zone, Wuhan City, Hubei Province Patentee before: WUDA GEOINFORMATICS Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder |