CN112862203B - Method, device, equipment and storage medium for determining regional fire station layout - Google Patents
Method, device, equipment and storage medium for determining regional fire station layout Download PDFInfo
- Publication number
- CN112862203B CN112862203B CN202110199741.7A CN202110199741A CN112862203B CN 112862203 B CN112862203 B CN 112862203B CN 202110199741 A CN202110199741 A CN 202110199741A CN 112862203 B CN112862203 B CN 112862203B
- Authority
- CN
- China
- Prior art keywords
- fire
- demand point
- demand
- target
- fighting
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004364 calculation method Methods 0.000 claims description 14
- 230000015654 memory Effects 0.000 claims description 11
- 230000001105 regulatory effect Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 7
- 238000010276 construction Methods 0.000 abstract description 4
- 238000007726 management method Methods 0.000 description 34
- 238000012216 screening Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013439 planning Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000001629 suppression Effects 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
- 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/0635—Risk analysis of enterprise or organisation activities
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Alarm Systems (AREA)
Abstract
The application provides a method, a device, equipment and a storage medium for determining regional fire station layout, wherein the method comprises the following steps: dividing the area to be planned into grids, and taking the center point of each divided grid as a fire-fighting demand point of the grid; determining the type of the demand point of each fire-fighting demand point by utilizing a fire risk level distribution map of the area to be planned; and outputting the minimum number of target fire stations required to meet the output constraint condition and the position coordinates of each target fire station on the basis that all the existing fire stations are reserved and the total range of the management and control areas of the output fire stations is larger than or equal to the area to be planned by utilizing the position set coverage model. On the basis of reducing construction resources, the jurisdiction range of the fire station can be reasonably determined according to the division principle that the fire station reaches the high-risk demand point in the management and control jurisdiction and is faster than the non-high-risk demand point, so that the rescue efficiency of fire in the area is improved.
Description
Technical Field
The invention relates to the technical field of urban fire control planning, in particular to a method, a device, equipment and a storage medium for determining regional fire station layout.
Background
The fire station is an important component of urban fire-fighting infrastructure, is a main force for fire suppression, and plays an important role in maintaining urban safety and stability. In the urban area, the fire station is reasonably arranged, so that the fire rescue efficiency can be improved, and personnel and economic losses caused by fire disaster can be reduced. In order to strengthen the fire safety layout of cities, improve the emergency efficiency of the cities to fire risks, how to determine the layout of fire stations in the cities becomes a technical problem which needs to be solved urgently in the technical field of current urban fire control planning.
The number of the fire stations to be built is mainly determined according to the area of an urban area, the urban main body is divided into equal areas, and the divided unit area is used as a jurisdiction area of the fire stations to determine the addresses of the fire stations to be built. Thus, if the range of the jurisdiction is too large, the fire rescue efficiency is easily reduced; if the range of the jurisdiction is too small, the resource allocation is easy to waste, so that the conventional method for determining the layout of the urban fire station is difficult to estimate a reasonable fire control jurisdiction, the fire safety of the urban can not be ensured, and the resource waste is easy to cause.
Disclosure of Invention
Accordingly, the present invention is directed to a method, apparatus, device and storage medium for determining a regional fire station layout, so as to reasonably determine the jurisdiction of the fire station and improve the rescue efficiency of fire in the region on the basis of reducing the construction resources of the fire station.
In a first aspect, an embodiment of the present invention provides a method for determining a regional fire station layout, the method including:
dividing the area to be planned into grids, and taking the center point of each divided grid as a fire-fighting demand point of the grid;
determining a demand point type of each fire control demand point by using the fire risk level distribution map of the area to be planned, wherein the demand point type at least comprises: high risk demand points and non-high risk demand points;
inputting a position coordinate set of a fire station, position coordinates of each fire-fighting demand point and a demand point type to which the fire-fighting demand point belongs into a position set coverage model to obtain an output result of the position set coverage model, wherein the fire station comprises: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire sites required to meet the output constraints, and the location coordinates of each of the target fire sites.
Optionally, the determining, by using the fire risk level distribution map of the area to be planned, a type of a demand point to which each fire protection demand point belongs includes:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
if the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
and if the maximum fire risk level value is smaller than or equal to the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point.
Optionally, before the location coordinate set of the fire-fighting site, the location coordinate of each fire-fighting demand point, and the type of the demand point to which the fire-fighting demand point belongs are input into the location set coverage model, the method further includes:
For the central point of each grid, judging whether the address information accords with the fire station configurable standard or not by utilizing the address information corresponding to the central point in the area to be planned, wherein the address information at least comprises: the current situation of the land where the center point is located, the minimum distance from the dangerous source and the minimum distance from the evacuation outlet of the personnel-intensive place;
and if the address information meets the fire station building standard, determining the central point as the fire station to be built.
Optionally, after the input location set overlay model, the method further comprises:
for each fire station, determining the shortest path between the fire station and each fire demand point in the road network data of the area to be planned;
calculating the driving time of the shortest path, and taking the calculation result as the road network time distance between the fire station and a target demand point, wherein the target demand point is the fire-fighting demand point corresponding to the shortest path;
judging whether the grid where the target demand point is located belongs to the management and control district of the fire station or not by utilizing the road network time distance and the type of the demand point where the target demand point is located;
And outputting the minimum number of target fire-fighting sites required to meet the output constraint conditions and the position coordinates of the target fire-fighting sites from the fire-fighting sites according to the judging result.
Optionally, the calculating the driving time of the shortest path includes:
calculating the driving time of each urban road contained in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road contained in the shortest path according to a second driving speed, wherein the second driving speed is greater than the first driving speed;
and calculating the sum of the running time of each urban road and the running time of each non-urban road, and taking the calculation result as the running time of the shortest path.
Optionally, the determining whether the grid where the target demand point is located belongs to the management and control district of the fire station by using the road network time distance and the demand point type to which the target demand point belongs includes:
aiming at each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is smaller than or equal to a first time threshold value, determining that a grid where the target demand point is located belongs to a management and control district of the fire station;
When the target demand point belongs to the non-high risk demand point, if the road network time distance is smaller than or equal to a second time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station, wherein the second time threshold is larger than the first time threshold.
Optionally, the outputting, according to the judging result, the minimum number of target fire-fighting sites required to meet the output constraint condition and the position coordinates of each target fire-fighting site from each fire-fighting site includes:
extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set;
extracting target demand points in a management and control district of each fire station to be built aiming at each fire station to be built to obtain a second demand point set of the fire station to be built;
taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points capable of containing a minimum number required for the first set of demand points;
And extracting the fire stations to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire stations to be built and the existing fire stations as the target fire stations for output.
In a second aspect, an embodiment of the present invention further provides an apparatus for determining a regional fire station layout, where the apparatus includes:
the grid dividing module is used for dividing the area to be planned by grids, and taking the center point of each divided grid as a fire-fighting demand point of the grid;
the classification module is configured to determine a demand point type to which each fire protection demand point belongs by using a fire risk level distribution map of the area to be planned, where the demand point type at least includes: high risk demand points and non-high risk demand points;
the processing module is used for inputting a position coordinate set of a fire-fighting site, position coordinates of each fire-fighting demand point and a demand point type to which the fire-fighting demand point belongs into a position set coverage model to obtain an output result of the position set coverage model, wherein the fire-fighting site comprises: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire sites required to meet the output constraints, and the location coordinates of each of the target fire sites.
Optionally, the classification module is further configured to:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
if the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
and if the maximum fire risk level value is smaller than or equal to the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point.
Optionally, the apparatus further includes:
the screening module is configured to determine, according to a center point of each grid, whether the address information meets a fire station configurable standard by using address information corresponding to the center point in the area to be planned, where the address information at least includes: the current situation of the land where the center point is located, the minimum distance from the dangerous source and the minimum distance from the evacuation outlet of the personnel-intensive place;
And the judging module is used for determining the central point as the fire station to be built if the address information accords with the fire station building standard.
Optionally, the processing module further includes:
the query unit is used for determining the shortest path between each fire station and each fire demand point in the road network data of the area to be planned for each fire station;
the calculation unit is used for calculating the driving time of the shortest path and taking a calculation result as a road network time distance between the fire-fighting site and a target demand point, wherein the target demand point is the fire-fighting demand point corresponding to the shortest path;
the judging unit is used for judging whether the grid where the target demand point is located belongs to the management and control district of the fire station or not by utilizing the road network time distance and the demand point type to which the target demand point belongs;
and the output unit is used for outputting the minimum number of target fire-fighting sites required by meeting the output constraint conditions and the position coordinates of each target fire-fighting site from each fire-fighting site according to the judging result.
Optionally, the computing unit is further configured to:
Calculating the driving time of each urban road contained in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road contained in the shortest path according to a second driving speed, wherein the second driving speed is greater than the first driving speed;
and calculating the sum of the running time of each urban road and the running time of each non-urban road, and taking the calculation result as the running time of the shortest path.
Optionally, the judging unit is further configured to:
aiming at each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is smaller than or equal to a first time threshold value, determining that a grid where the target demand point is located belongs to a management and control district of the fire station;
when the target demand point belongs to the non-high risk demand point, if the road network time distance is smaller than or equal to a second time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station, wherein the second time threshold is larger than the first time threshold.
Optionally, the output unit is further configured to:
extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set;
extracting target demand points in a management and control district of each fire station to be built aiming at each fire station to be built to obtain a second demand point set of the fire station to be built;
taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points capable of containing a minimum number required for the first set of demand points;
and extracting the fire stations to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire stations to be built and the existing fire stations as the target fire stations for output.
In a third aspect, embodiments of the present application provide a computer device including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method for determining a regional fire station layout described above when the computer program is executed by the processor.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor performs the steps of the above-described method of determining a regional fire station layout.
The technical scheme provided by the embodiment of the application can comprise the following beneficial effects:
the method comprises the steps that firstly, a region to be planned is divided into a plurality of smaller grid regions, the center point of the grid region is used as a fire-fighting demand point of the grid region, so that a fire risk level distribution map of the region to be planned can be utilized, the maximum fire risk level of the grid region where each fire-fighting demand point is located is determined, and each fire-fighting demand point can be divided into: the high-risk demand points and the non-high-risk demand points are considered, the fire rescue difficulty of the area where the high-risk demand points are located is higher than that of the area where the non-high-risk demand points are located, and the probability of fire occurrence of the area where the high-risk demand points are located is high, so that the demand point type of the fire-fighting demand points is input into the position set coverage model for each fire-fighting demand point, and therefore, in the position set coverage model, the management scope of the fire-fighting sites can be reasonably determined according to the division principle that the fire-fighting sites reach the high-risk demand points in the management and control district and the fire-fighting rescue efficiency in the area is improved.
Further, the fire station for inputting the location set coverage model includes: the output constraint conditions of the model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and under the constraint of the constraint condition, the position set covers model output: the minimum number of target fire sites required to meet the output constraints, and the location coordinates of each of the target fire sites. Therefore, on the basis of realizing the full coverage of the area to be planned in the management and control district of the fire station, the number of newly increased fire stations to be built can be minimized, and the construction resources required to be consumed by newly built fire stations can be reduced.
In order to make the above objects, features and advantages of the present invention more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for determining a regional fire station layout according to an embodiment of the present application;
FIG. 2 is a flow chart of a method for determining a fire site that can be built in an area according to an embodiment of the present application;
FIG. 3 is a schematic flow chart of a model processing method of a location set coverage model according to an embodiment of the present application;
FIG. 4 is a flow chart of a method for determining fire site administration jurisdiction scope according to an embodiment of the present application;
FIG. 5 is a flow chart of a method of screening a target fire site for export according to an embodiment of the present application;
FIG. 6 is a schematic structural diagram of an apparatus for determining a regional fire station layout according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a computer device 700 according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the invention, as presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be made by a person skilled in the art without making any inventive effort, are intended to be within the scope of the present invention.
The embodiment of the invention provides a method, a device, equipment and a storage medium for determining the layout of a regional fire station, and the description is given below by way of embodiments.
Example 1
FIG. 1 is a flow chart of a method for determining a regional fire station layout according to an embodiment of the present application, the method including steps S101-S104; specific:
s101, dividing the area to be planned into grids, and taking the center point of each divided grid as a fire-fighting demand point of the grid.
Specifically, considering that obvious environmental differences may exist between different subareas in the area to be planned, and different external environments correspond to different fire-fighting demands, for example, fire-fighting rescue difficulty in a densely built area is far higher than that in a scattered building area, and fire-fighting rescue difficulty in an area closer to a dangerous source is far higher than that in an area farther away; therefore, the area to be planned can be divided into a plurality of grids with areas far smaller than the area to be planned according to the unit area threshold, and for each divided grid, the center point of the grid is used as the fire-fighting demand point of the area where the grid is located. Therefore, the jurisdiction boundary of the fire station when the fire control demands can be met can be further determined by analyzing the fire control demands of the areas where the different grids are located, the jurisdiction range of the fire station can be reasonably determined, and the fire rescue efficiency in the areas is improved.
For example, if the area of the area to be planned is 146 square kilometers, the area to be planned may be divided into grids in a grid platform by using a fishemet tool and taking the area to be planned as a range according to the unit grid area size of 500m×500m, so as to obtain grids after being divided, and taking the central point of each grid as a fire-fighting demand point of the grid.
S102, determining a demand point type of each fire control demand point by using the fire risk level distribution map of the area to be planned, wherein the demand point type at least comprises: high risk demand points and non-high risk demand points.
In this embodiment, as an optional embodiment, the determining, using the fire risk level distribution map of the area to be planned, a type of a demand point to which each fire protection demand point belongs includes:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
If the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
and if the maximum fire risk level value is smaller than or equal to the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point.
For example, if the fire risk level distribution map includes: a class 1 fire risk, a class 2 fire risk, a class 3 fire risk, a class 4 fire risk, and a class 5 fire risk level, wherein a higher fire risk level for a region indicates a greater probability of fire occurring in the region; the preset fire risk level threshold is as follows: taking the fire-fighting demand point a as an example, if the maximum fire risk level value contained in the grid where the fire-fighting demand point a is located is: 2-level fire risk, wherein the fire-fighting demand point a belongs to a non-high-risk demand point; if the maximum fire risk level value contained in the grid where the fire-fighting demand point a is located is: and 4-level fire risk, and the fire-fighting demand point a belongs to a high-risk demand point.
And S103, inputting a position coordinate set of the fire-fighting site, the position coordinates of each fire-fighting demand point and the type of the demand point to which the fire-fighting demand point belongs into a position set coverage model to obtain an output result of the position set coverage model.
Specifically, wherein, the fire station includes: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire sites required to meet the output constraints, and the location coordinates of each of the target fire sites.
It should be noted that, considering that the area to be planned may include the existing fire stations, the location set coverage model in the present application is to solve, on the basis of reserving the existing fire stations, the minimum number of fire stations to be built required for realizing the full coverage of the area to be planned in the fire control management area, so as to reduce the construction resources of the fire stations.
In a possible implementation manner, fig. 2 shows a schematic flow chart of a method for determining a fire site that can be built in an area provided in the example of the present application, as shown in fig. 2, after performing step S102, the method further includes S201-S202; specific:
S201, aiming at the central point of each grid, judging whether the address information accords with the fire station configurable standard or not by utilizing the address information corresponding to the central point in the area to be planned.
Specifically, the address information at least includes: the current situation of the place where the central point is located, the minimum distance from the dangerous source and the minimum distance from the evacuation outlet of the personnel-intensive place.
Specifically, the dangerous sources may be: areas and places where inflammable and explosive articles, chemical dangerous articles, oil and gas tanks, and other dangerous articles which are easy to cause fire disaster are stored. The personnel intensive sites may be: public gathering places, outpatient buildings of hospitals, ward buildings, schools, public libraries, museums, and the like.
In this embodiment, as an optional embodiment, the determining whether the address information meets the fire station configurable standard includes:
judging whether the position of the center point belongs to a current reserved land or not by utilizing the current situation of the land;
if the position of the center point is determined not to belong to the current reserved land, judging whether the minimum distance between the position of the center point and the dangerous source is larger than a first threshold value or not;
if the minimum distance between the position of the central point and the dangerous source is determined to be greater than the first threshold value, judging whether the minimum distance between the position of the central point and the evacuation outlet of the personnel-intensive place is greater than a second threshold value;
And if the minimum distance between the position of the central point and the evacuation outlet of the personnel-intensive place is determined to be greater than the second threshold value, determining that the address information accords with the fire station configurable standard.
For example, if the first threshold is 300 meters and the second threshold is 50 meters, the fire station may establish the standard as follows: the current situation of the land is as follows: the minimum distance between the non-existing reserved land and the dangerous source is more than 300 meters, and the minimum distance between the non-existing reserved land and the evacuation outlet of the personnel-intensive place is more than 50 meters. S202, if the address information meets the fire station building standard, determining the central point as the fire station to be built.
In the above example, the present situation of the place where the center point b is located is as follows: the minimum distance between the position of the central point b and the dangerous source is as follows: the minimum distance between the position of the center point b and the evacuation outlet of the personnel-intensive place is 240 meters: 100 meters, the minimum distance between the position of the center point b and the dangerous source is smaller than the first threshold value: 300 meters, thus, the central point b is not the fire station to be built; if the current situation of the place where the center point c is located is: the minimum distance between the position of the central point c and the dangerous source of the non-current reserved place is as follows: the minimum distance between the position of the center point c and the evacuation outlet of the personnel-intensive place is 340 m: 120 meters, the center point c is the fire station to be built.
In a possible implementation manner, fig. 3 shows a schematic flow chart of a model processing method of the location set coverage model provided in the example of the present application, as shown in fig. 3, and when step S103 is performed, the method further includes S301-S304; specific:
s301, determining the shortest path between each fire station and each fire demand point in the road network data of the area to be planned according to each fire station.
Specifically, the road network data refers to a traffic road network in the area to be planned, and the road network data at least includes: the starting point coordinates, the ending point coordinates, the road track, the road passing direction and the type of the road of each existing road in the area to be planned, wherein the type of the road comprises: urban roads and non-urban roads.
For example, in the ArcGis platform, for each fire station, the fire station is taken as a starting point, each fire demand point is taken as a destination, and an OD cost matrix is utilized to determine a minimum cost path between the starting point and each destination in road network data of the area to be planned, where the minimum cost path is the shortest path.
S302, calculating the driving time of the shortest path, and taking the calculation result as the road network time distance between the fire-fighting site and a target demand point, wherein the target demand point is the fire-fighting demand point corresponding to the shortest path.
Specifically, since urban roads are located in urban central zones, traffic is relatively congested, but non-urban roads are located in urban suburban areas and other relatively open areas, the traffic capacity of the urban roads is lower than that of the non-urban roads, so that the shortest path can be split according to the urban roads and the non-urban roads to obtain the total length of the urban roads and the total length of the non-urban roads in the shortest path, and the running time of the urban roads and the running time of the non-urban roads are calculated respectively according to the running speed of the urban roads being lower than that of the non-urban roads, and the sum of the running time of the two roads is taken as the running time of the shortest path. Therefore, the calculation result of the driving time is more in line with the rescue time required by actual fire rescue, and the accuracy of the division result of the jurisdiction of the fire station can be improved.
In this embodiment of the present application, as an optional embodiment, the calculating the running time of the shortest path includes:
Calculating the driving time of each urban road contained in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road contained in the shortest path according to a second driving speed, wherein the second driving speed is greater than the first driving speed;
and calculating the sum of the running time of each urban road and the running time of each non-urban road, and taking the calculation result as the running time of the shortest path.
An exemplary illustration is that the first driving speed is: 35km/h, the second driving speed is: for example, if the total length of the shortest path is 60 km/h: 2.4km, wherein the total length of the urban road is: the total length of the non-urban roads of 1.4km is: 1km, according to the running speed of the urban road being 35km/h and the running speed of the non-urban road being 60km/h, the running time of the urban road can be calculated as follows: 2.4 minutes, the driving time of the non-urban road is as follows: 1 minute, therefore, the travel time of the shortest path is 3.4 minutes, and the road network time distance between the fire station and the target demand point is 3.4 minutes.
S303, judging whether the grid where the target demand point is located belongs to the management and control district of the fire station or not by utilizing the road network time distance and the demand point type to which the target demand point belongs.
Specifically, considering that the fire rescue difficulty in the area where the high-risk demand point is located is higher than that in the area where the non-high-risk demand point is located, as an alternative embodiment, the control conditions of the fire-fighting site on the target demand points of different demand point types may be distinguished according to the driving time from the fire-fighting site to the high-risk demand point being smaller than that from the fire-fighting site to the non-high-risk demand point.
For the example illustration, for the target demand point a belonging to the high risk demand point, if the road network time distance between the fire station x and the target demand point a is less than 3 minutes, it may be determined that the grid where the target demand point a is located belongs to the management and control district of the fire station x; for a target demand point B belonging to a non-high risk demand point, if the road network time distance between the fire station x and the target demand point B is less than 4 minutes, determining that the grid where the target demand point B is located belongs to the management and control district of the fire station x; therefore, in the management and control district of the fire station x, the running time from the fire station to the high-risk demand point can be ensured to be shorter, and the rescue efficiency of fire control in the area can be improved.
S304, outputting the minimum number of target fire-fighting sites required by meeting the output constraint conditions and the position coordinates of the target fire-fighting sites from the fire-fighting sites according to the judging result.
For example, the existing fire sites in the area to be planned are: n1, the fire station to be built is: n2, n3 and n4, and the grid division result of the area to be planned is as follows: grid 1, grid 2, grid 3, grid 4, grid 5, wherein, the fire control demand point of grid 1 is x1, the fire control demand point of grid 2 is x2, the fire control demand point of grid 3 is x3, the fire control demand point of grid 4 is x4, the fire control demand point of grid 5 is x5, include in the management and control district of current fire station n 1: fire control demand points x1 and x4, and the management and control district of the fire station n2 to be built comprises: the fire control demand points x1, x2 and x4, and the management and control district of the fire station n3 to be built comprises: the fire control demand points x2 and x3, and the management and control district of the fire station n4 to be built comprises: because the fire-fighting demand points x2, x3 and x5 can meet the output constraint condition by only newly adding one fire-fighting site n4 to be built on the basis of reserving the existing fire-fighting site n1, the minimum number of the output target fire-fighting sites is 2, and the output target fire-fighting sites are: the existing fire station n1 and the fire station n4 to be built, and outputting the position coordinates of the existing fire station n1 and the fire station n4 to be built, and the fire station layout of the planned area is obtained by: on the basis of reserving the existing fire station n1, a fire station is newly added at the position coordinate of the fire station n4 to be built.
In a possible implementation, fig. 4 shows a schematic flow chart of a method for determining a fire station administration area range provided in the example of the present application, and as shown in fig. 4, when step S303 is performed, the method further includes S401-S402; specific:
s401, for each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is smaller than or equal to a first time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station.
For example, if the first time threshold is 3 minutes, for the target demand point C belonging to the high risk demand point, if the road network time distance between the target demand point C and the fire station n5 is 2 minutes and the road network time distance between the target demand point C and the fire station n6 is 5 minutes, it may be determined that the grid where the target demand point C is located belongs to the regulatory jurisdiction of the fire station n5, but does not belong to the regulatory jurisdiction of the fire station n 6.
And S402, when the target demand point belongs to the non-high risk demand point, if the road network time distance is smaller than or equal to a second time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station, wherein the second time threshold is larger than the first time threshold.
For example, if the first time threshold is 3 minutes, the second threshold may be 4 minutes, and for the target demand point D belonging to the non-high risk demand point, if the road network time distance between the target demand point D and the fire station n5 is 5 minutes and the road network time distance between the target demand point D and the fire station n6 is 3 minutes, it may be determined that the grid where the target demand point D is located belongs to the regulatory jurisdiction of the fire station n6, but does not belong to the regulatory jurisdiction of the fire station n 5.
In a possible implementation, fig. 5 shows a schematic flow chart of a method for screening a target fire site for output provided in the example of the present application, as shown in fig. 5, and in executing step S304, the method further includes S501-S504; specific:
s501, extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set.
In particular, the constraint due to the output constraint aims at: on the basis of realizing the whole coverage of the area to be planned in the management and control district of the fire station, the number of newly increased fire stations to be built is minimized, so that the total range of the management and control district of the newly increased fire stations to be built at least needs to contain grids where all target demand points in the first demand point set are located.
For example, if there is only one existing fire station n1 in the area M to be planned, all target demand points include: x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, wherein the target demand points located within the regulatory jurisdiction of the existing fire station n1 are: x1, x2, x3, extracting target demand points x4, x5, x6, x7, x8, x9, x10 to obtain a first demand point set as follows: { x4, x5, x6, x7, x8, x9, x10}.
S502, extracting target demand points in the management and control district of each fire station to be built according to each fire station to be built, and obtaining a second demand point set of the fire station to be built.
For the exemplary illustration, taking the above example as an example, if the fire station to be built in the area to be planned M includes: n2, n3, n4, n5, n6, wherein the target demand points located inside the management and control district of the fire station to be built n2 include: x1, x2, x3, x4, the target demand points located inside the regulatory jurisdiction of the fire station to be built n3 include: x5, x6, x7, the target demand points located inside the regulatory jurisdiction of the fire station to be built n4 include: x8, x9, x10, the target demand points located inside the regulatory jurisdiction of the fire station to be built n5 include: x6, x10, target demand points located within the regulatory jurisdiction of the fire station to be built n6 include: x1, x2, x8, the second set of demand points for fire station n2 to be built is: { x1, x2, x3, x4}; the second set of demand points for fire station n3 to be built is: { x5, x6, x7}; the second set of demand points for fire station n4 to be built is: { x8, x9, x10}; the second set of demand points for fire station n5 to be built is: { x6, x10}; the second set of demand points for fire station n6 to be built is: { x1, x2, x8}.
S503, taking an intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points can be included that is the minimum number required for the first set of demand points.
For the exemplary illustration, taking the above example as an example, the third set of demand points T2 of the fire station n2 to be built is: { x4}; the third set of demand points T3 for the fire station n3 to be built is: { x5, x6, x7}; the third set of demand points T4 for the fire station n4 to be built is: { x8, x9, x10}; the third set of demand points T5 for the fire station n5 to be built is: { x6, x10}; the third set of demand points T6 for the fire station n6 to be built is: { x8}, since the first set of demand points is: { x4, x5, x6, x7, x8, x9, x10}, therefore, the fourth set of extracted demand points is: t2, T3, T4.
S504, extracting the fire station to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire station to be built and the existing fire station as the output target fire station.
For example, taking the above example as an example, the fourth set of extracted demand points is: t2, T3 and T4, wherein T2 is a third demand point set of a fire station n2 to be built, T3 is a third demand point set of a fire station n3 to be built, and T4 is a third demand point set of a fire station n4 to be built, so that fire stations n2, n3 and n4 to be built are extracted from all fire stations to be built, and an existing fire station n1 and fire stations n2, n3 and n4 to be built are taken as target fire stations.
Example two
Fig. 6 shows a schematic structural diagram of an apparatus for determining a regional fire station layout according to an embodiment of the present application, where the apparatus includes:
the grid dividing module 601 is configured to divide a region to be planned by using a center point of each divided grid as a fire-fighting demand point of the grid;
the classification module 602 is configured to determine, by using the fire risk level distribution map of the area to be planned, a demand point type to which each fire protection demand point belongs, where the demand point type at least includes: high risk demand points and non-high risk demand points;
the processing module 603 is configured to input a location coordinate set of a fire-fighting site, a location coordinate of each fire-fighting demand point, and a demand point type to which the fire-fighting demand point belongs into a location set coverage model, and obtain an output result of the location set coverage model, where the fire-fighting site includes: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire sites required to meet the output constraints, and the location coordinates of each of the target fire sites.
Optionally, the classification module 602 is further configured to:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
if the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
and if the maximum fire risk level value is smaller than or equal to the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point.
Optionally, the apparatus further includes:
a screening module (not shown in the figure) configured to determine, for each central point of the grid, whether the address information meets a fire station configurable standard by using address information corresponding to the central point in the area to be planned, where the address information at least includes: the current situation of the land where the center point is located, the minimum distance from the dangerous source and the minimum distance from the evacuation outlet of the personnel-intensive place;
And the judging module (not shown in the figure) is used for determining the central point as the fire station to be built if the address information meets the fire station building standard.
Optionally, the processing module 603 further includes:
a query unit (not shown in the figure) for determining, for each fire-fighting site, a shortest path between the fire-fighting site and each fire-fighting demand point in the road network data of the area to be planned;
a calculating unit (not shown in the figure) for calculating the driving time of the shortest path, and taking the calculation result as the road network time distance between the fire station and a target demand point, wherein the target demand point is the fire demand point corresponding to the shortest path;
a judging unit (not shown in the figure) for judging whether the grid where the target demand point is located belongs to the administration area of the fire station by using the road network time distance and the type of the demand point where the target demand point is located;
and an output unit (not shown in the figure) for outputting, from among the fire-fighting sites, a minimum number of target fire-fighting sites required to meet the output constraint condition and position coordinates of the target fire-fighting sites, according to the judgment result.
Optionally, the computing unit is further configured to:
calculating the driving time of each urban road contained in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road contained in the shortest path according to a second driving speed, wherein the second driving speed is greater than the first driving speed;
and calculating the sum of the running time of each urban road and the running time of each non-urban road, and taking the calculation result as the running time of the shortest path.
Optionally, the judging unit is further configured to:
aiming at each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is smaller than or equal to a first time threshold value, determining that a grid where the target demand point is located belongs to a management and control district of the fire station;
when the target demand point belongs to the non-high risk demand point, if the road network time distance is smaller than or equal to a second time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station, wherein the second time threshold is larger than the first time threshold.
Optionally, the output unit is further configured to:
extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set;
extracting target demand points in a management and control district of each fire station to be built aiming at each fire station to be built to obtain a second demand point set of the fire station to be built;
taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points capable of containing a minimum number required for the first set of demand points;
and extracting the fire stations to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire stations to be built and the existing fire stations as the target fire stations for output.
Example III
As shown in fig. 7, an embodiment of the present application provides a computer device 700 for performing the method for determining the layout of a regional fire station in the present application, where the device includes a memory 701, a processor 702, and a computer program stored in the memory 701 and executable on the processor 702, where the processor 702 implements the steps of the method for determining the layout of a regional fire station when executing the computer program.
Specifically, the memory 701 and the processor 702 may be general-purpose memories and processors, which are not particularly limited herein, and the above-described method of determining the regional fire station layout can be performed when the processor 702 runs a computer program stored in the memory 701.
Corresponding to the method for determining the regional fire station layout in the present application, the embodiment of the present application further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor performs the steps of the method for determining the regional fire station layout described above.
In particular, the storage medium can be a general-purpose storage medium, such as a removable disk, a hard disk, etc., on which a computer program is executed that is capable of performing the above-described method of determining a regional fire station layout.
In the embodiments provided herein, it should be understood that the disclosed systems and methods may be implemented in other ways. The system embodiments described above are merely illustrative, e.g., the division of the elements is merely a logical functional division, and there may be additional divisions in actual implementation, and e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, system or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments provided in the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
It should be noted that: like reference numerals and letters in the following figures denote like items, and thus once an item is defined in one figure, no further definition or explanation of it is required in the following figures, and furthermore, the terms "first," "second," "third," etc. are used merely to distinguish one description from another and are not to be construed as indicating or implying relative importance.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present application, and are not intended to limit the scope of the present application, but the present application is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, the present application is not limited thereto. Any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or make equivalent substitutions for some of the technical features within the technical scope of the disclosure of the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the corresponding technical solutions. Are intended to be encompassed within the scope of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (7)
1. A method of determining a regional fire station layout, the method comprising:
according to the unit area threshold value, dividing the area to be planned into grids, and taking the center point of each divided grid as a fire-fighting demand point of the grid;
determining a demand point type of each fire control demand point by using the fire risk level distribution map of the area to be planned, wherein the demand point type at least comprises: high risk demand points and non-high risk demand points;
inputting a position coordinate set of a fire station, position coordinates of each fire-fighting demand point and a demand point type to which the fire-fighting demand point belongs into a position set coverage model to obtain an output result of the position set coverage model, wherein the fire station comprises: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire stations required to meet the output constraint conditions, and the position coordinates of each of the target fire stations; in the position set coverage model, determining the management and control district of each fire station according to the division principle that the fire station reaches a higher risk demand point in the management and control district faster than a non-higher risk demand point;
The determining, by using the fire risk level distribution map of the to-be-planned area, a demand point type to which each fire protection demand point belongs includes:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
if the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
if the maximum fire risk level value is smaller than or equal to the fire risk level threshold value, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point;
wherein after the input location set overlay model, the method further comprises:
for each fire station, determining the shortest path between the fire station and each fire demand point in the road network data of the area to be planned;
Calculating the driving time of the shortest path, and taking the calculation result as the road network time distance between the fire station and a target demand point, wherein the target demand point is the fire-fighting demand point corresponding to the shortest path;
judging whether the grid where the target demand point is located belongs to the management and control district of the fire station or not by utilizing the road network time distance and the type of the demand point where the target demand point is located;
outputting the minimum number of target fire-fighting sites required to meet the output constraint conditions and the position coordinates of the target fire-fighting sites from the fire-fighting sites according to the judging result;
and outputting, from each fire station, a minimum number of target fire stations required to meet the output constraint condition and position coordinates of each target fire station according to the judgment result, wherein the method comprises the steps of:
extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set;
extracting target demand points in a management and control district of each fire station to be built aiming at each fire station to be built to obtain a second demand point set of the fire station to be built;
Taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points capable of containing a minimum number required for the first set of demand points;
and extracting the fire stations to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire stations to be built and the existing fire stations as the target fire stations for output.
2. The method of claim 1, wherein before inputting the location coordinate set of the fire-fighting site, the location coordinate of each of the fire-fighting demand points, and the type of demand point to which the fire-fighting demand point belongs into the location set overlay model, the method further comprises:
for the central point of each grid, judging whether the address information accords with the fire station configurable standard or not by utilizing the address information corresponding to the central point in the area to be planned, wherein the address information at least comprises: the current situation of the land where the center point is located, the minimum distance from the dangerous source and the minimum distance from the evacuation outlet of the personnel-intensive place;
And if the address information meets the fire station building standard, determining the central point as the fire station to be built.
3. The method of claim 1, wherein said calculating the travel time of the shortest path comprises:
calculating the driving time of each urban road contained in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road contained in the shortest path according to a second driving speed, wherein the second driving speed is greater than the first driving speed;
and calculating the sum of the running time of each urban road and the running time of each non-urban road, and taking the calculation result as the running time of the shortest path.
4. The method of claim 1, wherein the determining whether the grid in which the target demand point is located belongs to the regulatory jurisdiction of the fire station by using the road network time distance and the type of the demand point to which the target demand point belongs comprises:
aiming at each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is smaller than or equal to a first time threshold value, determining that a grid where the target demand point is located belongs to a management and control district of the fire station;
When the target demand point belongs to the non-high risk demand point, if the road network time distance is smaller than or equal to a second time threshold, determining that the grid where the target demand point is located belongs to the management and control district of the fire station, wherein the second time threshold is larger than the first time threshold.
5. An apparatus for determining a regional fire station layout, the apparatus comprising:
the grid dividing module is used for dividing the area to be planned according to the unit area threshold value, and taking the center point of each divided grid as a fire-fighting demand point of the grid;
the classification module is configured to determine a demand point type to which each fire protection demand point belongs by using a fire risk level distribution map of the area to be planned, where the demand point type at least includes: high risk demand points and non-high risk demand points;
the processing module is used for inputting a position coordinate set of a fire-fighting site, position coordinates of each fire-fighting demand point and a demand point type to which the fire-fighting demand point belongs into a position set coverage model to obtain an output result of the position set coverage model, wherein the fire-fighting site comprises: the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire station, the total control district range of the output fire station is larger than or equal to the area to be planned, and the output result comprises: the minimum number of target fire stations required to meet the output constraint conditions, and the position coordinates of each of the target fire stations; in the position set coverage model, determining the management and control district of each fire station according to the division principle that the fire station reaches a higher risk demand point in the management and control district faster than a non-higher risk demand point;
When determining the type of the fire-fighting demand point by using the fire risk level distribution map of the area to be planned, the classification module is configured to:
determining a maximum fire risk level value contained in a position area corresponding to each fire-fighting demand point in the fire risk level distribution map by utilizing a first grid, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk level value is larger than the fire risk level threshold value or not by utilizing a preset fire risk level threshold value;
if the maximum fire risk level value is larger than the fire risk level threshold, determining that the type of the demand point to which the fire-fighting demand point belongs is the high-risk demand point;
if the maximum fire risk level value is smaller than or equal to the fire risk level threshold value, determining that the type of the demand point to which the fire-fighting demand point belongs is the non-high risk demand point;
wherein, the processing module further includes:
the query unit is used for determining the shortest path between each fire station and each fire demand point in the road network data of the area to be planned for each fire station;
The calculation unit is used for calculating the driving time of the shortest path and taking a calculation result as a road network time distance between the fire-fighting site and a target demand point, wherein the target demand point is the fire-fighting demand point corresponding to the shortest path;
the judging unit is used for judging whether the grid where the target demand point is located belongs to the management and control district of the fire station or not by utilizing the road network time distance and the demand point type to which the target demand point belongs;
the output unit is used for outputting the minimum number of target fire-fighting sites required by meeting the output constraint conditions and the position coordinates of the target fire-fighting sites from the fire-fighting sites according to the judging result;
wherein, output unit is still used for:
extracting target demand points outside the management and control district of the existing fire station from all the target demand points to obtain a first demand point set;
extracting target demand points in a management and control district of each fire station to be built aiming at each fire station to be built to obtain a second demand point set of the fire station to be built;
taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire station to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is: a third set of demand points capable of containing a minimum number required for the first set of demand points;
And extracting the fire stations to be built corresponding to each fourth demand point set from all the fire stations to be built, and taking the extracted fire stations to be built and the existing fire stations as the target fire stations for output.
6. An electronic device, comprising: a processor, a memory and a bus, said memory storing machine readable instructions executable by said processor, said processor and said memory communicating over the bus when the electronic device is running, said machine readable instructions when executed by said processor performing the steps of the method of determining a regional fire station layout as claimed in any one of claims 1 to 4.
7. A computer readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, performs the steps of the method of determining a regional fire station layout as claimed in any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110199741.7A CN112862203B (en) | 2021-02-22 | 2021-02-22 | Method, device, equipment and storage medium for determining regional fire station layout |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110199741.7A CN112862203B (en) | 2021-02-22 | 2021-02-22 | Method, device, equipment and storage medium for determining regional fire station layout |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112862203A CN112862203A (en) | 2021-05-28 |
| CN112862203B true CN112862203B (en) | 2024-03-08 |
Family
ID=75989899
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110199741.7A Active CN112862203B (en) | 2021-02-22 | 2021-02-22 | Method, device, equipment and storage medium for determining regional fire station layout |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112862203B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113486880A (en) * | 2021-07-28 | 2021-10-08 | 浙江商汤科技开发有限公司 | Image acquisition equipment arrangement method and device, electronic equipment and storage medium |
| CN113516323B (en) * | 2021-09-15 | 2021-11-30 | 山东蓝湾新材料有限公司 | Transportation path recommendation method |
| CN113926109A (en) * | 2021-10-21 | 2022-01-14 | 安徽中盛轨道交通产业有限公司 | Automatic fire extinguishing system for electric appliance cabinet of subway train carriage |
| CN114066319B (en) * | 2021-12-01 | 2022-05-17 | 清华大学 | Fireproof planning method and device for historical block, electronic equipment and storage medium |
| CN115409402A (en) * | 2022-09-13 | 2022-11-29 | 西南林业大学 | Layout method of self-adaptive miniature forest fire station |
| CN116128014B (en) * | 2023-04-17 | 2023-08-04 | 深圳市明源云科技有限公司 | Hydrant layout method, device, electronic equipment and computer readable storage medium |
| CN116739310B (en) * | 2023-08-11 | 2023-10-24 | 威海市城市规划技术服务中心有限公司 | Building site survey planning system based on geographic information |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882294A (en) * | 2010-06-24 | 2010-11-10 | 公安部上海消防研究所 | urban fire risk assessment method based on criterion |
| CN107748939A (en) * | 2017-11-06 | 2018-03-02 | 天津龙文科技有限公司 | A kind of computer approach of fire station layout optimization |
| CN111861131A (en) * | 2020-06-22 | 2020-10-30 | 上海市政工程设计研究总院（集团）有限公司 | Fire risk assessment method based on tough city idea |
| CN112370710A (en) * | 2020-11-03 | 2021-02-19 | 蒋蕊 | Big data-based smart city fire-fighting joint management system and method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10817889B2 (en) * | 2017-09-21 | 2020-10-27 | T-Mobile Usa, Inc. | Geographic boundary determination service |
-
2021
- 2021-02-22 CN CN202110199741.7A patent/CN112862203B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882294A (en) * | 2010-06-24 | 2010-11-10 | 公安部上海消防研究所 | urban fire risk assessment method based on criterion |
| CN107748939A (en) * | 2017-11-06 | 2018-03-02 | 天津龙文科技有限公司 | A kind of computer approach of fire station layout optimization |
| CN111861131A (en) * | 2020-06-22 | 2020-10-30 | 上海市政工程设计研究总院（集团）有限公司 | Fire risk assessment method based on tough city idea |
| CN112370710A (en) * | 2020-11-03 | 2021-02-19 | 蒋蕊 | Big data-based smart city fire-fighting joint management system and method |
Non-Patent Citations (6)
| Title |
|---|
| 城市POI火灾风险评估与消防设施布局优化研究――以武汉市主城区为例;祝明明;罗静;余文昌;周洋;周亮;;地域研究与开发(第04期);第88-93页 * |
| 城市应急避难场所层次布局研究(Ⅱ)——三级层次选址模型;陈志芬等;《自然灾害学报》;第19卷(第05期);第13-19页 * |
| 城市消防站选址布局优化及对雄安新区的启示;陈志芬等;《中国安全生产科学技术》;第14卷(第9期);第12-17页 * |
| 基于ArcGIS空间分析技术的城市消防站规划布局创新方法;朴佳子;;北京规划建设(第04期);第109-112页 * |
| 基于火灾风险的城市消防站布局评估技术;贺俊杰等;《消防科学与技术》;第40卷(第1期);第130-134页 * |
| 快速城市化下的南通市消防站布局优化研究;梁建琴;钞振华;张乘献;吴倩倩;董玲;;测绘与空间地理信息(第01期);第39-43页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112862203A (en) | 2021-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112862203B (en) | Method, device, equipment and storage medium for determining regional fire station layout | |
| Kulshrestha et al. | Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty | |
| Jia et al. | Review of urban transportation network design problems based on CiteSpace | |
| CN111044060B (en) | Multi-vehicle path planning method and multi-vehicle path planning system | |
| US20130253889A1 (en) | Modeling and simulation capability for resource consumption and consequence management | |
| Dong et al. | Study on urban fire station planning based on fire risk assessment and GIS technology | |
| CN103996089A (en) | Electric transmission line optimal path generation method based on GIS | |
| CN102393926B (en) | Intelligent decision-making method of safe route for underground emergent people evacuation | |
| CN113255979B (en) | Method and device for identifying vulnerability of urban public transport network, computer equipment and storage medium | |
| CN112784002A (en) | Virtual scene generation method, device, equipment and storage medium | |
| Borowska-Stefańska et al. | Emergency management of self-evacuation from flood hazard areas in Poland | |
| Tali et al. | Location–Allocation model applied to urban public services: Spatial analysis of fire stations in Mysore urban area Karnataka, India | |
| Saldanha | Applications of building information modelling for planning and delivery of rapid transit | |
| Mahajan et al. | Vulnerability assessment of Alberta's provincial highway network | |
| Liu et al. | Design and Research on the intelligent System of Urban Rail Transit Project based on BIM+ GIS | |
| CN113177046B (en) | Road network topological graph generation method, device, equipment and storage medium | |
| Koriashkina et al. | TWO-STAGE PROBLEMS OF OPTIMAL LOCATION AND DISTRIBUTION OF THE HUMANITARIAN LOGISTICS SYSTEM’S STRUCTURAL SUBDIVISIONS. | |
| CN113160589A (en) | Vehicle early warning method and device, electronic equipment and computer readable storage medium | |
| Zhu et al. | The impact of dynamic traffic conditions on the sustainability of urban fire service | |
| Wong et al. | A technical review on developing BIM-oriented indoor route planning | |
| Chen et al. | Ambulance service area considering disaster-induced disturbance on the transportation infrastructure | |
| Onelcin et al. | Evacuation plan of an industrial zone: Case study of a chemical accident in Aliaga, Turkey and the comparison of two different simulation softwares | |
| Beukes et al. | Quantifying the contextual influences on road design | |
| CN114863075A (en) | Fire-fighting evacuation path planning method, device and equipment based on multiple sensors | |
| CN114792038A (en) | Cable layout method, device, equipment and storage medium based on environmental data |
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 |