CN112862203A - 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
- CN112862203A CN112862203A CN202110199741.7A CN202110199741A CN112862203A CN 112862203 A CN112862203 A CN 112862203A CN 202110199741 A CN202110199741 A CN 202110199741A CN 112862203 A CN112862203 A CN 112862203A
- Authority
- CN
- China
- Prior art keywords
- fire
- fighting
- demand point
- demand
- target
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000004364 calculation method Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 7
- 238000010276 construction Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 6
- 238000012216 screening Methods 0.000 description 4
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 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
- 238000007726 management method Methods 0.000 description 3
- 239000000463 material Substances 0.000 description 3
- 230000002349 favourable effect Effects 0.000 description 2
- 238000013439 planning Methods 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
- 238000003672 processing method Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001629 suppression Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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: carrying out grid type division on an area to be planned, and taking the central point of each divided grid as a fire-fighting demand point of the grid; determining the type of a demand point to which each fire-fighting demand point belongs by using the fire risk level distribution map of the area to be planned; and outputting the minimum number of target fire-fighting sites required by meeting the output constraint condition and the position coordinates of each target fire-fighting site by using a position set coverage model on the basis of keeping all the existing fire-fighting sites and the condition that the total range of the output fire-fighting sites is greater than or equal to the area to be planned. 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 high-risk demand points reaching the control jurisdiction are faster than the non-high-risk demand points, and the rescue efficiency of fire fighting in the jurisdiction is improved.
Description
Technical Field
The invention relates to the technical field of urban fire-fighting 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 the safety and stability of cities. In the urban area scope, reasonable setting fire station can improve fire rescue efficiency, is favorable to reducing personnel and economic loss that the conflagration leads to. In order to strengthen the fire safety layout of a city and improve the emergency efficiency of the city to fire risks, how to determine the layout of fire stations in the city becomes a technical problem which needs to be solved urgently in the technical field of current urban fire-fighting planning.
The existing method mainly determines the number of fire stations to be built according to the area of an urban area, and determines the address of the fire station to be built by dividing the urban area main body into equal areas and taking the divided unit area as the jurisdiction area of the fire station. Therefore, if the range of the jurisdiction area is too large, the fire rescue efficiency is easily reduced; if the scope of the jurisdiction is too small, the resource allocation is easily wasted, so that the conventional method for determining the layout of the urban fire station is difficult to predict a reasonable fire jurisdiction, cannot ensure the urban fire safety and easily causes the waste of resources.
Disclosure of Invention
In view of the above, the present invention provides a method, an apparatus, a device and a storage medium for determining a layout of a regional fire station, so as to reasonably determine a jurisdiction area of the fire station on the basis of reducing construction resources of the fire station, and improve rescue efficiency of fire fighting in the region.
In a first aspect, an embodiment of the present invention provides a method for determining a regional fire station layout, where the method includes:
carrying out grid type division on an area to be planned, and taking the central point of each divided grid as a fire-fighting demand point of the grid;
determining a demand point type to which each fire-fighting demand point belongs 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 set covering model by using a position coordinate set of a fire fighting site, a position coordinate of each fire fighting demand point and a demand point type to which the fire fighting demand point belongs, and obtaining an output result of the position set covering model, wherein the fire fighting site comprises: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
Optionally, the determining, by using the fire risk level distribution map of the area to be planned, a demand point type to which each fire demand point belongs includes:
aiming at each fire-fighting demand point, determining a maximum fire risk grade value contained in a position area by utilizing the position area corresponding to a first grid in the fire risk grade distribution map, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk grade value is greater than the fire risk grade threshold value or not by utilizing a preset fire risk grade threshold value;
if the maximum fire risk grade value is determined to be larger than the fire risk grade threshold value, 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 grade value is determined to be smaller than or equal to the fire risk grade 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.
Optionally, before inputting the position set coverage model with the position coordinate set of the fire fighting station, the position coordinate of each fire fighting demand point, and the demand point type to which the fire fighting demand point belongs, the method further includes:
aiming at the central point of each grid, judging whether the address information meets the standard which can be established by a fire station by utilizing the corresponding address information of the central point in the area to be planned, wherein the address information at least comprises: the current situation of the land where the central point is located, the minimum distance between the central point and a danger source and the minimum distance between the central point and an evacuation exit of a dense place;
and if the address information is determined to meet the standard which can be established by the fire station, determining the central point as the fire station to be established.
Optionally, after the input location set overlays the model, the method further includes:
for each fire fighting site, determining the shortest path between the fire fighting site and each fire fighting 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 fighting 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 a control jurisdiction of the fire-fighting site or not by utilizing the road network time distance and the demand point type to which the target demand point belongs;
and outputting the minimum number of target fire-fighting stations required by meeting the output constraint condition and the position coordinates of each target fire-fighting station from each fire-fighting station according to the judgment result.
Optionally, the calculating the travel time of the shortest path includes:
calculating the driving time of each urban road in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road 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 driving time of each urban road and the driving time of each non-urban road, and taking the calculation result as the driving time of the shortest path.
Optionally, the determining, by using the road network time distance and the demand point type to which the target demand point belongs, whether the grid to which the target demand point belongs to a control jurisdiction of the fire-fighting site includes:
for each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is less than or equal to a first time threshold, determining that the grid where the target demand point is located belongs to the control jurisdiction of the fire-fighting site;
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 a control jurisdiction of the fire-fighting station, wherein the second time threshold is larger than the first time threshold.
Optionally, the outputting, according to the determination result, a minimum number of target fire-fighting stations required to meet the output constraint condition and position coordinates of each of the target fire-fighting stations from each of the fire-fighting stations includes:
extracting target demand points outside a control jurisdiction of the existing fire-fighting site from all the target demand points to obtain a first demand point set;
for each fire-fighting station to be built, extracting a target demand point in a control jurisdiction of the fire-fighting station to be built to obtain a second demand point set of the fire-fighting 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-fighting site to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is as follows: a third set of demand points capable of containing a minimum required number of said first set of demand points;
and extracting the fire-fighting sites to be built corresponding to each fourth demand point set from all the fire-fighting sites to be built, and taking the extracted fire-fighting sites to be built and the existing fire-fighting sites as the output target fire-fighting sites.
In a second aspect, an embodiment of the present invention further provides an apparatus for determining a layout of regional fire stations, where the apparatus includes:
the grid division module is used for carrying out grid type division on the area to be planned, and the central point of each divided grid is used as a fire-fighting demand point of the grid;
the classification module is used for determining the type of the demand point to which each fire-fighting demand point belongs by using the fire risk level distribution map of the area to be planned, wherein the type of the demand point at least comprises the following steps: high risk demand points and non-high risk demand points;
the processing module is used for inputting a position set covering model into a position set coordinate set of a fire fighting site, a position coordinate of each fire fighting demand point and a demand point type to which the fire fighting demand point belongs, and obtaining an output result of the position set covering model, wherein the fire fighting site comprises: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
Optionally, the classification module is further configured to:
aiming at each fire-fighting demand point, determining a maximum fire risk grade value contained in a position area by utilizing the position area corresponding to a first grid in the fire risk grade distribution map, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk grade value is greater than the fire risk grade threshold value or not by utilizing a preset fire risk grade threshold value;
if the maximum fire risk grade value is determined to be larger than the fire risk grade threshold value, 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 grade value is determined to be smaller than or equal to the fire risk grade 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.
Optionally, the apparatus further includes:
the screening module is used for judging whether the address information meets the standard which can be established by the fire station or not by utilizing the corresponding address information of the central point in the area to be planned aiming at the central point of each grid, wherein the address information at least comprises: the current situation of the land where the central point is located, the minimum distance between the central point and a danger source and the minimum distance between the central point and an evacuation exit of a dense place;
and the judging module is used for determining the central point as the fire station to be built if the address information is determined to meet the standard which can be built by the fire station.
Optionally, the processing module further includes:
the query unit is used for determining the shortest path between each fire-fighting station and each fire-fighting demand point in the road network data of the area to be planned aiming at each fire-fighting station;
the calculation unit is used for calculating the driving time of the shortest path and taking the calculation result as the road network time distance between the fire fighting station 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 control jurisdiction of the fire-fighting station or not by utilizing the road network time distance and the demand point type where the target demand point belongs;
and the output unit is used for outputting the minimum number of the target fire-fighting stations required by meeting the output constraint condition and the position coordinates of each target fire-fighting station from each fire-fighting station according to the judgment result.
Optionally, the computing unit is further configured to:
calculating the driving time of each urban road in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road 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 driving time of each urban road and the driving time of each non-urban road, and taking the calculation result as the driving time of the shortest path.
Optionally, the determining unit is further configured to:
for each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is less than or equal to a first time threshold, determining that the grid where the target demand point is located belongs to the control jurisdiction of the fire-fighting site;
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 a control jurisdiction of the fire-fighting 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 a control jurisdiction of the existing fire-fighting site from all the target demand points to obtain a first demand point set;
for each fire-fighting station to be built, extracting a target demand point in a control jurisdiction of the fire-fighting station to be built to obtain a second demand point set of the fire-fighting 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-fighting site to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is as follows: a third set of demand points capable of containing a minimum required number of said first set of demand points;
and extracting the fire-fighting sites to be built corresponding to each fourth demand point set from all the fire-fighting sites to be built, and taking the extracted fire-fighting sites to be built and the existing fire-fighting sites as the output target fire-fighting sites.
In a third aspect, an embodiment of the present application provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor, when executing the computer program, implements the steps of the method for determining a layout of regional fire stations described above.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having a computer program stored thereon, where the computer program is executed by a processor to perform the steps of the method for determining a layout of regional fire stations.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
this application will be waited to plan regional division into a plurality of less grid region earlier to the regional central point of grid is as this regional fire control demand point of grid, thereby, can utilize the regional fire risk grade distribution diagram of waiting to plan, confirms the regional maximum fire risk grade of grid that each fire control demand point belongs to, according to the relative size of the maximum fire risk grade between each fire control demand point, can divide into each fire control demand point: the high-risk demand points and the non-high-risk demand points are considered that 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 in the area where the high-risk demand points are located is higher, therefore, for each fire-fighting demand point, the type of the demand point to which the fire-fighting demand point belongs is input to a position set covering model, and therefore in the position set covering model, the jurisdiction range of the fire-fighting site can be reasonably determined according to the division principle that the fire-fighting site reaches the high-risk demand points in the management and control jurisdiction faster than that of the non-high-risk demand points, and the fire-fighting rescue efficiency in.
Further, entering a fire site of the location aggregation overlay model includes: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned have the following output constraint conditions: on the basis of reserving each existing fire-fighting site, outputting a position set coverage model output, wherein the total range of the output fire-fighting site control jurisdiction is greater than or equal to the area to be planned, and under the constraint of the constraint condition: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites. Therefore, on the basis of realizing the comprehensive coverage of the to-be-planned area in the control jurisdiction of the fire station, the number of newly-added to-be-built fire stations can be minimized, and the construction resources required to be consumed by newly-built fire stations are reduced.
In order to make the aforementioned and other objects, features and advantages of the present invention 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 needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a flow chart illustrating a method for determining a regional fire station layout provided by an embodiment of the present application;
FIG. 2 is a flow chart illustrating a method for determining available fire stations in a region according to an embodiment of the present disclosure;
FIG. 3 is a flow chart illustrating a method for model processing of a location aggregation overlay model provided by an embodiment of the present application;
fig. 4 is a schematic flowchart illustrating a method for determining a jurisdiction control range of a fire-fighting site according to an embodiment of the present application;
FIG. 5 is a schematic flow chart diagram illustrating a method for screening targeted fire stations for export according to an embodiment of the present application;
FIG. 6 is a schematic structural diagram illustrating an apparatus for determining a layout of regional fire stations according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of a computer device 700 according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. The components of 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 present invention, 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 derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention provides a method, a device, equipment and a storage medium for determining regional fire station layout, which are described by the embodiment below.
Example one
FIG. 1 is a schematic flow chart diagram illustrating a method for determining a regional fire station layout according to an embodiment of the present application, the method including steps S101-S104; specifically, the method comprises the following steps:
and S101, carrying out grid type division on the area to be planned, and taking the central point of each divided grid as a fire-fighting demand point of the grid.
Specifically, it is considered that there may be an obvious environmental difference between different sub-areas in the area to be planned, and different external environments correspond to different fire fighting requirements, for example, the fire fighting and rescue difficulty in areas with dense buildings is much higher than that in areas with scattered buildings, and the fire fighting and rescue difficulty in areas closer to the hazard source is much higher than that in areas farther away; therefore, the area to be planned can be divided into a plurality of grids with the areas far smaller than the area to be planned according to the unit area threshold value, and the central point of each divided 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 fighting demand can be met can be further determined by analyzing the fire fighting demands of the areas where different grids are located, the jurisdiction range of the fire station can be reasonably determined, and the fire fighting rescue efficiency in the areas is improved.
Illustratively, if the area of the area to be planned is 146 square kilometers, the area to be planned may be divided into grids in an ArcGis platform in a grid manner by using a fisher 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 the grids are divided, and the central point of each grid is used as a fire-fighting demand point of the grid.
S102, determining a demand point type to which each fire-fighting demand point belongs 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 the type of the demand point to which each fire demand point belongs by using the fire risk level distribution map of the area to be planned includes:
aiming at each fire-fighting demand point, determining a maximum fire risk grade value contained in a position area by utilizing the position area corresponding to a first grid in the fire risk grade distribution map, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk grade value is greater than the fire risk grade threshold value or not by utilizing a preset fire risk grade threshold value;
if the maximum fire risk grade value is determined to be larger than the fire risk grade threshold value, 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 grade value is determined to be smaller than or equal to the fire risk grade 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.
Illustratively, if the fire risk levels included in the fire risk level distribution map include: level 1 fire risk, level 2 fire risk, level 3 fire risk, level 4 fire risk and level 5 fire risk level, wherein a higher fire risk level of a region indicates a higher probability of a fire in the region; the preset fire risk level threshold is as follows: taking the fire demand point a as an example, if the maximum fire risk level value included in the grid where the fire demand point a is located is: if the fire risk is level 2, the fire-fighting demand point a belongs to a non-high risk demand point; if the maximum fire risk grade value contained in the grid where the fire-fighting demand point a is located is: and 4, fire risk level, the fire-fighting demand point a belongs to a high risk demand point.
S103, inputting a position coordinate set of a fire fighting station, a position coordinate 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, and obtaining an output result of the position set coverage model.
Specifically, wherein, fire control site includes: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
It should be noted that, in consideration of the fact that the area to be planned may include an existing fire station, the location aggregation coverage model in the application solves the minimum number of fire stations to be built, which is required for realizing the comprehensive coverage of the area to be planned in a fire control administration and control jurisdiction, on the basis of reserving the existing fire stations, so as to reduce the construction resources of the fire stations.
In a possible embodiment, fig. 2 is a schematic flow chart illustrating a method for determining available fire-fighting sites in a region according to an embodiment of the present application, and as shown in fig. 2, after step S102 is executed, the method further includes S201-S202; specifically, the method comprises the following steps:
s201, aiming at the central point of each grid, judging whether the address information accords with the fire station constructable standard or not by utilizing the corresponding address information of the central point in the area to be planned.
Specifically, the address information at least includes: the current situation of the land where the central point is located, the minimum distance between the central point and a danger source and the minimum distance between the central point and an evacuation exit of a dense place.
In particular, the hazard source may be: areas and places where flammable and explosive materials, chemical dangerous materials, oil and gas tanks, and other dangerous materials which are easy to cause fire are stored. The crowded place may be: public gathering places, hospital outpatient buildings, ward buildings, schools, public libraries, museums and the like.
In this embodiment, as an optional embodiment, the determining whether the address information meets the standards that can be established by the fire station includes:
judging whether the position of the central point belongs to the current reserved land or not by using the current situation of the land;
if the position of the central point is determined not to belong to the current situation reserved land, judging whether the minimum distance between the position of the central point and the hazard source is greater than a first threshold value or not;
if the minimum distance between the position of the central point and the hazard 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 exit of the dense personnel place is greater than a second threshold value;
and if the minimum distance between the position of the central point and the evacuation exit of the dense place of the people is determined to be greater than the second threshold value, determining that the address information meets the standard which can be established by the fire station.
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 land is as follows: the minimum distance between the non-current reserve site and the hazard source is greater than 300 meters, and the minimum distance between the non-current reserve site and the evacuation exit of the dense personnel site is greater than 50 meters. S202, if the address information is determined to meet the standard which can be established by the fire station, determining the central point as the fire station to be established.
For illustrative purposes, still taking the above example as an example, if the current land situation at the position of the center point b is: in the non-current conservation site, the minimum distance between the position of the central point b and the hazard source is as follows: 240 meters, the minimum distance between the position of the central point b and the evacuation exit of the dense place of people is as follows: 100 meters, then since the minimum distance between the position of the central point b and the hazard is less than the first threshold: 300 meters, so the center point b is not a fire station to be built; if the current land situation of the position of the central point c is as follows: in the non-current conservation site, the minimum distance between the position of the central point c and the hazard source is as follows: 340 m, the minimum distance between the position of the central point c and the evacuation exit of the dense place of people is as follows: and if the distance is 120 meters, the central point c is a fire-fighting station to be built.
In a possible implementation, fig. 3 shows a flowchart of a model processing method of a location set coverage model provided in an embodiment of the present application, and as shown in fig. 3, when step S103 is executed, the method further includes S301-S304; specifically, the method comprises the following steps:
s301, aiming at each fire-fighting station, determining the shortest path between the fire-fighting station and each fire-fighting demand point in the road network data of the area to be planned.
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 method comprises the following steps of starting point coordinates, ending point coordinates, road tracks, road traffic directions and types of roads of each existing road in the area to be planned, wherein the types of the roads comprise: urban roads and non-urban roads.
As an exemplary illustration, in the ArcGis platform, for each fire-fighting site, the fire-fighting site is used as a starting point, each fire-fighting demand point is used as a destination, and an OD cost matrix is used to determine, in the road network data of the area to be planned, a minimum cost path between the starting point and each destination, 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 station 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 areas and are relatively congested in traffic, and non-urban roads are located in relatively open areas such as suburban 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, the driving time of the urban roads and the driving time of the non-urban roads are respectively calculated according to the driving speed of the urban roads lower than that of the non-urban roads, and the sum of the driving times of the two roads is used as the driving time of the shortest path. Therefore, the calculation result of the driving time is more consistent with the rescue time needed to be spent in actual fire rescue, and the accuracy of division results of the jurisdiction range of the fire station can be improved.
In this embodiment, as an optional embodiment, the calculating the travel time of the shortest path includes:
calculating the driving time of each urban road in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road 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 driving time of each urban road and the driving time of each non-urban road, and taking the calculation result as the driving time of the shortest path.
For example, the first driving speed is: 35km/h, wherein the second driving speed is as follows: for example, 60km/h, if the total length of the shortest path is: 2.4km, wherein the total length of the urban road is as follows: 1.4km, total length of non-urban road: 1km, then the driving time of the urban road can be calculated according to the driving speed of 35km/h of the urban road and the driving speed of 60km/h of the non-urban road: 2.4 minutes, the driving time of non-urban roads 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 control jurisdiction of the fire-fighting station or not by using the road network time distance and the demand point type where the target demand point belongs.
Specifically, considering that the difficulty of fire rescue 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 optional embodiment, the control conditions of the fire-fighting station on the target demand points of different demand point types can be distinguished according to the driving time from the fire-fighting station to the high-risk demand point, which is less than the driving time from the fire-fighting station to the non-high-risk demand point.
For an exemplary description, for a target demand point a belonging to a high-risk demand point, if a road network time distance between a fire-fighting site x and the target demand point a is less than 3 minutes, it may be determined that a grid where the target demand point a is located belongs to a control jurisdiction of the fire-fighting site x; for a target demand point B belonging to a non-high-risk demand point, if the road network time distance between the fire-fighting site 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 control jurisdiction of the fire-fighting site x; like this, in the management and control district of fire control website x, can guarantee to reach the driving time of high risk demand point from the fire control website shorter, be favorable to improving the rescue efficiency of fire control in the region.
And S304, outputting the minimum number of the target fire-fighting stations required by meeting the output constraint condition and the position coordinates of each target fire-fighting station from each fire-fighting station according to the judgment result.
For example, the existing fire-fighting sites in the area to be planned are: n1, the fire-fighting station to be built is: n2, n3 and n4, wherein the grid division result of the region 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, have included in the management and control jurisdiction of fire control website n 1: fire-fighting demand points x1 and x4, the fire-fighting station n2 to be built comprises: fire-fighting demand points x1, x2 and x4, and a fire-fighting station n3 to be built comprises: fire-fighting demand points x2 and x3, and a fire-fighting station n4 to be built comprises: the fire-fighting demand points x2, x3 and x5 meet the output constraint condition only by adding a new fire-fighting station n4 to be built on the basis of keeping the existing fire-fighting station n1, so that the minimum number of output target fire-fighting stations is 2, and the output target fire-fighting stations are: the layout of the fire station in the area to be planned is obtained by the steps of obtaining an existing fire station n1 and a fire station n4 to be built, and outputting position coordinates of the existing fire station n1 and the fire station n4 to be built: on the basis of reserving the existing fire station n1, a new fire station is added at the position coordinate of the fire station n4 to be built.
In a possible embodiment, fig. 4 is a schematic flowchart illustrating a method for determining a jurisdiction range of a fire-fighting site provided in an embodiment of the present application, where as shown in fig. 4, when step S303 is executed, the method further includes S401-S402; specifically, the method comprises the following steps:
s401, 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 less than or equal to a first time threshold value, determining that the grid where the target demand point is located belongs to the control jurisdiction of the fire-fighting station.
For example, if the first time threshold is 3 minutes, for a target demand point C belonging to a high-risk demand point, if a road network time distance between the target demand point C and a fire station n5 is 2 minutes, and a road network time distance between the target demand point C and a fire station n6 is 5 minutes, it may be determined that a grid in which the target demand point C is located belongs to a control jurisdiction of the fire station n5, but does not belong to a control jurisdiction of the fire station n 6.
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 a control jurisdiction of the fire-fighting 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 a target demand point D belonging to a non-high-risk demand point, if a road network time distance between the target demand point D and the fire station n5 is 5 minutes, and a road network time distance between the target demand point D and the fire station n6 is 3 minutes, it may be determined that a grid in which the target demand point D is located belongs to a control jurisdiction of the fire station n6, but does not belong to a control jurisdiction of the fire station n 5.
In a possible embodiment, fig. 5 shows a flowchart of a method for screening a target fire-fighting site for export according to an embodiment of the present application, and as shown in fig. 5, when step S304 is executed, the method further includes S501-S504; specifically, the method comprises the following steps:
s501, extracting target demand points outside a control jurisdiction of the existing fire-fighting site from all the target demand points to obtain a first demand point set.
Specifically, the constraint of the output constraint condition aims to: on the basis of realizing the comprehensive coverage of the to-be-planned area of the control jurisdiction of the fire-fighting sites, the number of newly-added fire-fighting sites to be built is minimum, and therefore the total range of the control jurisdiction of the newly-added fire-fighting sites to be built at least needs to include the grids where the target demand points in the first demand point set are located.
Illustratively, if there is only one existing fire site n1 in the area M to be planned, all the target demand points include: x1, x2, x3, x4, x5, x6, x7, x8, x9 and x10, wherein the target demand points in the control jurisdiction of the existing fire-fighting site n1 are as follows: x1, x2 and x3, extracting target demand points x4, x5, x6, x7, x8, x9 and x10 to obtain a first demand point set which is: { x4, x5, x6, x7, x8, x9, x10 }.
S502, aiming at each fire-fighting site to be built, extracting a target demand point in a control jurisdiction of the fire-fighting site to be built to obtain a second demand point set of the fire-fighting site to be built.
For illustrative purposes, and by way of example, if a fire station to be built in the area M to be planned includes: n2, n3, n4, n5 and n6, wherein the target demand points located inside the governing district of the fire-fighting station n2 to be built comprise: x1, x2, x3 and x4, wherein the target demand points located inside the control jurisdiction of the fire-fighting station n3 to be built comprise: x5, x6 and x7, wherein the target demand points located inside the control district of the fire-fighting station n4 to be built comprise: x8, x9 and x10, wherein the target demand points located inside the control district of the fire-fighting station n5 to be built comprise: x6 and x10, wherein the target demand points located inside the control jurisdiction of the fire-fighting station n6 to be built comprise: x1, x2 and x8, the second demand point set of the fire-fighting station n2 to be built is as follows: { x1, x2, x3, x4 }; the second demand point set of the fire-fighting station n3 to be built is as follows: { x5, x6, x7 }; the second demand point set of the fire-fighting station n4 to be built is as follows: { x8, x9, x10 }; the second demand point set of the fire-fighting station n5 to be built is as follows: { x6, x10 }; the second demand point set of the fire-fighting station n6 to be built is as follows: { x1, x2, x8 }.
S503, taking the intersection of the second demand point set and the first demand point set as a third demand point set of the fire-fighting site to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is as follows: a third set of demand points can be included that requires the minimum number of the first set of demand points.
Illustratively, taking the above example as an example, the third set of demand points T2 of the fire-fighting site n2 to be built is: { x4 }; the third demand point set T3 of the fire-fighting site n3 to be built is as follows: { x5, x6, x7 }; the third demand point set T4 of the fire-fighting site n4 to be built is as follows: { x8, x9, x10 }; the third demand point set T5 of the fire-fighting site n5 to be built is as follows: { x6, x10 }; the third demand point set T6 of the fire-fighting site n6 to be built is as follows: { x8}, since the first set of demand points is: { x4, x5, x6, x7, x8, x9, x10}, therefore, the fourth set of demand points extracted is: t2, T3, T4.
And S504, extracting the fire-fighting sites to be built corresponding to each fourth demand point set from all the fire-fighting sites to be built, and taking the extracted fire-fighting sites to be built and the existing fire-fighting sites as the output target fire-fighting sites.
Illustratively, taking the above example as an example, the extracted fourth demand point set is: t2, T3 and T4, wherein T2 is a third demand point set of a fire-fighting site n2 to be built, T3 is a third demand point set of a fire-fighting site n3 to be built, and T4 is a third demand point set of a fire-fighting site n4 to be built, so that the fire-fighting sites n2, n3 and n4 to be built are extracted from all the fire-fighting sites to be built, and an existing fire-fighting site n1 and the fire-fighting sites n2, n3 and n4 to be built are used as the target fire-fighting sites.
Example two
Fig. 6 shows a schematic structural diagram of an apparatus for determining a layout of regional fire stations according to an embodiment of the present application, where the apparatus includes:
the grid division module 601 is configured to perform grid type division on the area to be planned, and use a central point of each divided grid as a fire-fighting demand point of the grid;
a classification module 602, 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 demand point belongs, where the demand point types at least include: high risk demand points and non-high risk demand points;
a processing module 603, configured to input a position set coverage model into a position set of position coordinates 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, to obtain an output result of the position set coverage model, where the fire fighting site includes: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
Optionally, the classification module 602 is further configured to:
aiming at each fire-fighting demand point, determining a maximum fire risk grade value contained in a position area by utilizing the position area corresponding to a first grid in the fire risk grade distribution map, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk grade value is greater than the fire risk grade threshold value or not by utilizing a preset fire risk grade threshold value;
if the maximum fire risk grade value is determined to be larger than the fire risk grade threshold value, 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 grade value is determined to be smaller than or equal to the fire risk grade 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.
Optionally, the apparatus further includes:
a screening module (not shown in the figure), configured to determine, for a central point of each grid, whether address information corresponds to an address information of the central point in the area to be planned, where the address information at least includes: the current situation of the land where the central point is located, the minimum distance between the central point and a danger source and the minimum distance between the central point and an evacuation exit of a dense place;
and a judging module (not shown in the figure) configured to determine that the central point is the fire station to be established if it is determined that the address information meets the standard that can be established for the fire station.
Optionally, the processing module 603 further includes:
a query unit (not shown in the figure) for determining, for each fire-fighting station, a shortest path between the fire-fighting station 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), configured to calculate driving time of the shortest path, and use the calculation result as a road network time distance between the fire fighting station and a target demand point, where the target demand point is the fire fighting demand point corresponding to the shortest path;
a determining unit (not shown in the figure), configured to determine, by using the road network time distance and the demand point type to which the target demand point belongs, whether a grid where the target demand point is located belongs to a control jurisdiction of the fire fighting site;
and an output unit (not shown in the figure) for outputting, from each of the fire fighting stations, a minimum number of target fire fighting stations required to meet the output constraint condition and position coordinates of each of the target fire fighting stations according to the determination result.
Optionally, the computing unit is further configured to:
calculating the driving time of each urban road in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road 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 driving time of each urban road and the driving time of each non-urban road, and taking the calculation result as the driving time of the shortest path.
Optionally, the determining unit is further configured to:
for each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is less than or equal to a first time threshold, determining that the grid where the target demand point is located belongs to the control jurisdiction of the fire-fighting site;
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 a control jurisdiction of the fire-fighting 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 a control jurisdiction of the existing fire-fighting site from all the target demand points to obtain a first demand point set;
for each fire-fighting station to be built, extracting a target demand point in a control jurisdiction of the fire-fighting station to be built to obtain a second demand point set of the fire-fighting 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-fighting site to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is as follows: a third set of demand points capable of containing a minimum required number of said first set of demand points;
and extracting the fire-fighting sites to be built corresponding to each fourth demand point set from all the fire-fighting sites to be built, and taking the extracted fire-fighting sites to be built and the existing fire-fighting sites as the output target fire-fighting sites.
EXAMPLE III
As shown in fig. 7, an embodiment of the present application provides a computer device 700 for executing the method for determining a layout of regional fire stations in the present application, the device includes a memory 701, a processor 702, and a computer program stored in the memory 701 and executable on the processor 702, wherein the processor 702 implements the steps of the method for determining a layout of regional fire stations when executing the computer program.
Specifically, the memory 701 and the processor 702 may be general-purpose memory and processor, which are not limited in particular, and the processor 702 can execute the method for determining the layout of the regional fire station when executing the computer program stored in the memory 701.
Corresponding to the method for determining the layout of the regional fire station in the present application, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to perform the steps of the method for determining the layout of the regional fire station.
In particular, the storage medium can be a general-purpose storage medium, such as a removable disk, a hard disk, or the like, on which a computer program can be executed when executed to perform the above-described method for determining a layout of regional fire stations.
In the embodiments provided in the present application, it should be understood that the disclosed system and method may be implemented in other ways. The above-described system embodiments are merely illustrative, and for example, the division of the units is only one logical functional division, and there may be other divisions in actual implementation, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of systems or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments provided in the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into 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 or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus once an item is defined in one figure, it need not be further defined and explained in subsequent figures, and moreover, 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 above-mentioned embodiments are only specific embodiments of the present application, and are used for illustrating the technical solutions of the present application, but not limiting the same, and the scope of the present application is not limited thereto, and although the present application is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope disclosed in the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the present disclosure, which should be construed in light of the above teachings. Are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method of determining a regional fire station layout, the method comprising:
carrying out grid type division on an area to be planned, and taking the central point of each divided grid as a fire-fighting demand point of the grid;
determining a demand point type to which each fire-fighting demand point belongs 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 set covering model by using a position coordinate set of a fire fighting site, a position coordinate of each fire fighting demand point and a demand point type to which the fire fighting demand point belongs, and obtaining an output result of the position set covering model, wherein the fire fighting site comprises: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
2. The method according to claim 1, wherein the determining the type of demand point to which each fire demand point belongs by using the fire risk level distribution map of the area to be planned comprises:
aiming at each fire-fighting demand point, determining a maximum fire risk grade value contained in a position area by utilizing the position area corresponding to a first grid in the fire risk grade distribution map, wherein the first grid is the grid where the fire-fighting demand point is located;
judging whether the maximum fire risk grade value is greater than the fire risk grade threshold value or not by utilizing a preset fire risk grade threshold value;
if the maximum fire risk grade value is determined to be larger than the fire risk grade threshold value, 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 grade value is determined to be smaller than or equal to the fire risk grade 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.
3. The method of claim 1, wherein before inputting the set of location coordinates of the fire fighting site, the location coordinates of each of the fire demand points, and the type of demand point to which the fire demand point belongs into the location coverage model, the method further comprises:
aiming at the central point of each grid, judging whether the address information meets the standard which can be established by a fire station by utilizing the corresponding address information of the central point in the area to be planned, wherein the address information at least comprises: the current situation of the land where the central point is located, the minimum distance between the central point and a danger source and the minimum distance between the central point and an evacuation exit of a dense place;
and if the address information is determined to meet the standard which can be established by the fire station, determining the central point as the fire station to be established.
4. The method of claim 1, wherein after the set of input locations overlay models, the method further comprises:
for each fire fighting site, determining the shortest path between the fire fighting site and each fire fighting 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 fighting 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 a control jurisdiction of the fire-fighting site or not by utilizing the road network time distance and the demand point type to which the target demand point belongs;
and outputting the minimum number of target fire-fighting stations required by meeting the output constraint condition and the position coordinates of each target fire-fighting station from each fire-fighting station according to the judgment result.
5. The method of claim 4, wherein calculating the travel time of the shortest path comprises:
calculating the driving time of each urban road in the shortest path according to the first driving speed;
calculating the driving time of each non-urban road 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 driving time of each urban road and the driving time of each non-urban road, and taking the calculation result as the driving time of the shortest path.
6. The method according to claim 4, wherein the determining whether the grid where the target demand point is located belongs to a control jurisdiction of the fire-fighting site by using the road network time distance and the demand point type where the target demand point belongs comprises:
for each target demand point, when the target demand point belongs to the high-risk demand point, if the road network time distance is less than or equal to a first time threshold, determining that the grid where the target demand point is located belongs to the control jurisdiction of the fire-fighting site;
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 a control jurisdiction of the fire-fighting station, wherein the second time threshold is larger than the first time threshold.
7. The method of claim 4, wherein outputting, from each of the fire fighting stations, a minimum number of target fire fighting stations required to meet the output constraints and location coordinates of each of the target fire fighting stations according to the determination result comprises:
extracting target demand points outside a control jurisdiction of the existing fire-fighting site from all the target demand points to obtain a first demand point set;
for each fire-fighting station to be built, extracting a target demand point in a control jurisdiction of the fire-fighting station to be built to obtain a second demand point set of the fire-fighting 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-fighting site to be built, and extracting a fourth demand point set from each third demand point set, wherein the fourth demand point set is as follows: a third set of demand points capable of containing a minimum required number of said first set of demand points;
and extracting the fire-fighting sites to be built corresponding to each fourth demand point set from all the fire-fighting sites to be built, and taking the extracted fire-fighting sites to be built and the existing fire-fighting sites as the output target fire-fighting sites.
8. An apparatus for determining a regional fire station layout, the apparatus comprising:
the grid division module is used for carrying out grid type division on the area to be planned, and the central point of each divided grid is used as a fire-fighting demand point of the grid;
the classification module is used for determining the type of the demand point to which each fire-fighting demand point belongs by using the fire risk level distribution map of the area to be planned, wherein the type of the demand point at least comprises the following steps: high risk demand points and non-high risk demand points;
the processing module is used for inputting a position set covering model into a position set coordinate set of a fire fighting site, a position coordinate of each fire fighting demand point and a demand point type to which the fire fighting demand point belongs, and obtaining an output result of the position set covering model, wherein the fire fighting site comprises: the existing fire-fighting sites and the fire-fighting sites to be built in the area to be planned, wherein the output constraint conditions of the position set coverage model are as follows: on the basis of reserving each existing fire-fighting site, the total range of the outputted fire-fighting site in the control jurisdiction is greater than or equal to the area to be planned, and the output result comprises the following steps: a minimum number of target fire protection sites required to meet the output constraints, and location coordinates of each of the target fire protection sites.
9. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory communicating over the bus when the electronic device is operating, the machine readable instructions when executed by the processor performing the steps of the method of determining a layout of regional fire stations of any of claims 1 to 7.
10. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, performs the steps of the method of determining a layout of regional fire stations of any of claims 1 to 7.
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 true CN112862203A (en) | 2021-05-28 |
| CN112862203B 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) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113516323A (en) * | 2021-09-15 | 2021-10-19 | 山东蓝湾新材料有限公司 | Transportation path recommendation method |
| CN113926109A (en) * | 2021-10-21 | 2022-01-14 | 安徽中盛轨道交通产业有限公司 | Automatic fire extinguishing system for electric appliance cabinet of subway train carriage |
| CN114066319A (en) * | 2021-12-01 | 2022-02-18 | 清华大学 | 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 |
| WO2023005231A1 (en) * | 2021-07-28 | 2023-02-02 | 上海商汤智能科技有限公司 | Method and apparatus for determining position of image collection device, and electronic device and storage medium |
| CN116128014A (en) * | 2023-04-17 | 2023-05-16 | 深圳市明源云科技有限公司 | Hydrant layout method, device, electronic equipment and computer readable storage medium |
| CN116739310A (en) * | 2023-08-11 | 2023-09-12 | 威海市城市规划技术服务中心有限公司 | Building site survey planning system based on geographic information |
Citations (5)
| 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 |
| US20190087840A1 (en) * | 2017-09-21 | 2019-03-21 | T-Mobile Usa, Inc. | Geographic boundary determination service |
| 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 |
-
2021
- 2021-02-22 CN CN202110199741.7A patent/CN112862203B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882294A (en) * | 2010-06-24 | 2010-11-10 | 公安部上海消防研究所 | urban fire risk assessment method based on criterion |
| US20190087840A1 (en) * | 2017-09-21 | 2019-03-21 | T-Mobile Usa, Inc. | Geographic boundary determination service |
| 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 |
|---|
| 朴佳子;: "基于ArcGIS空间分析技术的城市消防站规划布局创新方法", 北京规划建设, no. 04, pages 109 - 112 * |
| 梁建琴;钞振华;张乘献;吴倩倩;董玲;: "快速城市化下的南通市消防站布局优化研究", 测绘与空间地理信息, no. 01, pages 39 - 43 * |
| 祝明明;罗静;余文昌;周洋;周亮;: "城市POI火灾风险评估与消防设施布局优化研究――以武汉市主城区为例", 地域研究与开发, no. 04, pages 88 - 93 * |
| 贺俊杰等: "基于火灾风险的城市消防站布局评估技术", 《消防科学与技术》, vol. 40, no. 1, pages 130 - 134 * |
| 陈志芬等: "城市应急避难场所层次布局研究(Ⅱ)——三级层次选址模型", 《自然灾害学报》, vol. 19, no. 05, pages 13 - 19 * |
| 陈志芬等: "城市消防站选址布局优化及对雄安新区的启示", 《中国安全生产科学技术》, vol. 14, no. 9, pages 12 - 17 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023005231A1 (en) * | 2021-07-28 | 2023-02-02 | 上海商汤智能科技有限公司 | Method and apparatus for determining position of image collection device, and electronic device and storage medium |
| CN113516323A (en) * | 2021-09-15 | 2021-10-19 | 山东蓝湾新材料有限公司 | Transportation path recommendation method |
| 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 |
| CN114066319A (en) * | 2021-12-01 | 2022-02-18 | 清华大学 | 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 |
| CN116128014A (en) * | 2023-04-17 | 2023-05-16 | 深圳市明源云科技有限公司 | Hydrant layout method, device, electronic equipment and computer readable storage medium |
| CN116128014B (en) * | 2023-04-17 | 2023-08-04 | 深圳市明源云科技有限公司 | Hydrant layout method, device, electronic equipment and computer readable storage medium |
| CN116739310A (en) * | 2023-08-11 | 2023-09-12 | 威海市城市规划技术服务中心有限公司 | Building site survey planning system based on geographic information |
| CN116739310B (en) * | 2023-08-11 | 2023-10-24 | 威海市城市规划技术服务中心有限公司 | Building site survey planning system based on geographic information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112862203B (en) | 2024-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112862203A (en) | Method, device, equipment and storage medium for determining regional fire station layout | |
| KR102297468B1 (en) | Digital twin modeling apparatus and modeling method using the same | |
| Chen et al. | TDVRP and BIM integrated approach for in-building emergency rescue routing | |
| Ronchi | Testing the predictive capabilities of evacuation models for tunnel fire safety analysis | |
| US20130253889A1 (en) | Modeling and simulation capability for resource consumption and consequence management | |
| CN103411619B (en) | A kind of three-dimensional road generation system and method | |
| Dong et al. | Study on urban fire station planning based on fire risk assessment and GIS technology | |
| CN112784002B (en) | Virtual scene generation method, device, equipment and storage medium | |
| CN110930651B (en) | Disaster early warning-based road vehicle management and control method, system and readable storage medium | |
| CN102393926B (en) | Intelligent decision-making method of safe route for underground emergent people evacuation | |
| CN104750895A (en) | Real-time city emergency evacuation simulating method and system based on mobile phone data | |
| CN112836878A (en) | BIM technology-based emergency evacuation method and device | |
| Saldanha | Applications of building information modelling for planning and delivery of rapid transit | |
| CN105787003A (en) | Method for obtaining vivid three-dimensional urban road map | |
| Hasan et al. | Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations | |
| Drogemuller | BIM support for disaster response | |
| EP4220505A1 (en) | System for designing train operation organization plan for rail transit | |
| CN113780714A (en) | Urban flood response emergency response system | |
| Schwabe et al. | BIM-based construction site layout planning and scheduling | |
| JPWO2016075933A1 (en) | Evacuation prediction system, model generation device, prediction device, evacuation prediction method, and computer-readable recording medium | |
| 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 | |
| JP2009031461A (en) | Device and method for predicting evacuation status in disaster | |
| Borowska-Stefańska et al. | Effectiveness of the policy for organising self-evacuation by private vehicle transport, as verified in microsimulations | |
| CN113570256A (en) | Data processing method and device applied to city planning, electronic equipment and medium |
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 |