Fire station and territorial space integrated layout decision support system and method

Abstract

The invention discloses a fire station and territorial space integrated layout decision support system and method, relates to the field of layout decision support, and comprehensively considers the two aspects of construction cost and construction period, so that the built fire station can better meet various requirements; the fire station layout integer programming model is solved, and places where the fire station needs to be built can be solved, so that the cost is within a budget range, and meanwhile, the total construction period is minimum; the method comprises the following steps: constructing a road network diagram between each fire station construction point and a plurality of fire station construction points in a primarily selected fire station construction point set; shortest path length data between each fire station construction point and a plurality of fire accident occurrence points is determined according to the road network diagram so as to perform final screening on the fire station construction points, and the layout rationality and accuracy of the constructed fire stations are further ensured.

Description

Technical Field

[0001] The present invention belongs to the field of layout decision support, and in particular, relates to a fire station and national land space integrated layout decision support system and method. Background Art

[0002] Chinese patent CN113850426B discloses a fire station site selection method, apparatus, terminal device and storage medium, constructing a first site selection model; determining a site selection plan for a first preset type of fire station when a first constraint condition corresponding to the first preset type of fire station is satisfied; constructing a second site selection model with the goal of minimizing the number of second preset type fire stations, minimizing the distance between the second preset type fire station and the target demand point, and maximizing the average distance between adjacent second preset type fire stations; and determining a site selection plan for the second preset type of fire station according to the second site selection model when a second constraint condition corresponding to the second preset type of fire station is satisfied.

[0003] When constructing a fire station, a long construction period means that the new fire station cannot be put into use in a timely manner, which may result in a longer time for the fire rescue team to arrive at the scene in emergency situations such as fire. Summary of the invention

[0004] In response to the problems in the related technology, the present invention proposes a fire station and national land space integrated layout decision support system and method to overcome the above-mentioned technical problems existing in the existing related technology.

[0005] In order to solve the above technical problems, the present invention is achieved through the following technical solutions: The present invention is a decision support method for the integrated layout of fire stations and national land space, comprising the following steps: S1. Set multiple fire station layout cost factor types and fire station layout construction cycle factor types to obtain a fire station layout cost factor type set and a fire station layout construction cycle factor type set; collect cost factor data of multiple fire station construction points according to the fire station layout cost factor type set to obtain a cost factor data matrix; evaluate the construction cycle factor data of multiple fire station construction points according to the fire station layout construction cycle factor type set to obtain a construction cycle factor data matrix; S2. constructing a fire station layout integer programming model according to the cost factor data matrix and the construction period factor data matrix; solving the fire station layout integer programming model to obtain a preliminary fire station construction point set; S3, constructing a road network diagram between each fire station construction point in the preliminary fire station construction point set and multiple fire accident occurrence points to obtain a road network diagram matrix; calculating the shortest path length of each road network diagram in the road network diagram matrix to obtain a shortest path length data matrix; S4, calculating the average shortest path length data of each fire station construction point in the shortest path length data matrix to obtain an average shortest path length data set; performing a final screening on the preliminary selected fire station construction point set according to the average shortest path length data set to obtain a final fire station construction point set; When building fire stations in cities, the construction cost and the construction period after the completion of the construction are factors that must be considered; therefore, this scheme comprehensively considers the construction cost and construction period when doing a single screening of fire station construction sites, so that the fire stations can meet multiple requirements after they are built; among them, by collecting the cost factor data and construction period factor data of multiple fire station construction sites, data support is provided for the subsequent construction of the integer programming model of the fire station layout; by solving the integer programming model of the fire station layout, it can be solved where the fire station needs to be built, so that the total construction period is the shortest while the cost is within the budget; by constructing a road network diagram between each fire station construction site and multiple fire station construction sites in the preliminary fire station construction site concentration, the purpose is to determine the shortest path length between each fire station construction site and multiple fire accident occurrence sites. If the shortest path length between the fire station construction site and the fire accident occurrence site is too long, it will lead to low rescue efficiency; therefore, in this scheme, the fire station construction sites are screened again according to the shortest path length data between each fire station construction site and multiple fire accident occurrence sites, so as to further ensure the rationality and accuracy of the layout of the constructed fire stations.

[0006] Preferably, the S1 comprises the following steps: S11. Set a fire station construction area, set a number of fire station construction points in the fire station construction area, and obtain a fire station construction point set. , a i Indicates the setting i Fire station construction sites, Indicates the total number of fire station construction sites set; Set multiple fire station layout cost factor types and fire station layout construction period factor types to obtain a fire station layout cost factor type set And the fire station layout construction cycle factor type set ; , , , , They represent land cost factor type, construction cost factor type, equipment cost factor type, maintenance cost factor type, and labor cost factor type, respectively. Indicates the setting i Types of factors in the construction period of fire station layout, b Indicates the total number of set fire station layout construction cycle factor types; S12, collecting cost factor data of each fire station construction point in the fire station construction point set according to the fire station layout cost factor type set, and obtaining a cost factor data matrix ; Then, according to the fire station layout construction cycle factor type set, the construction cycle factor data of each fire station construction point in the fire station construction point set is evaluated to obtain the construction cycle factor data matrix ; , They are as follows: ; ; in, , , , , They represent the concentration of the fire station construction points. i The land cost factor data, construction cost factor data, equipment cost factor data, maintenance cost factor data and labor cost factor data of each fire station construction site; Indicates that the fire station construction point is concentrated in the first i The first fire station construction site j Types of construction cycle factor data; The types of cycle factors for the layout and construction of fire stations mainly include cycle factors in the preliminary preparation stage, cycle factors in the design stage, cycle factors in the approval stage, cycle factors in the bidding and procurement stage, cycle factors in the construction stage, and cycle factors in the acceptance and delivery stage.

[0007] Preferably, S2 comprises the following steps: S21. Set the total budget of each type of fire station layout cost factor in the fire station layout cost factor type set when building a fire station, and obtain a total budget data set for the fire station layout. , , , , , They respectively represent the total budget data of land cost factors, the total budget data of construction cost factors, the total budget data of equipment cost factors, the total budget data of maintenance cost factors, and the total budget data of labor cost factors; S22, constructing a fire station layout integer programming model based on the total budget data set of the fire station layout, the construction period factor data matrix and the cost factor data matrix; the objective function of the fire station layout integer programming model is as follows: ; In the formula, Indicates the total construction period of the fire station under construction; Indicates the setting i Undetermined coefficients, ; The constraint condition group of the fire station layout integer programming model is as follows, ; S23, solving the fire station layout integer programming model to obtain a preliminary fire station construction point set , c 1i represents the first i Fire station construction sites, represents the total number of fire station construction points obtained by solving the fire station layout integer programming model; Since a budget for construction investment is often set in a construction plan, the corresponding budget data are set for various types of cost factors by setting the total budget data of land cost factors, construction cost factors, equipment cost factors, maintenance cost factors and labor cost factors. This provides constraint data for the subsequent construction of a constraint condition group for the fire station layout integer programming model, making the fire station layout integer programming model solvable.

[0008] Preferably, the S23 comprises the following steps: S231. Construction of the first slime mold population , represents the first i Only slime mold, represents the size of the first slime mold population; sets the maximum number of iterations of the first slime mold population to d 1. The current number of iterations is d 2, respectively, are recorded as the first maximum number of iterations and the first current number of iterations; the search space dimension of the first slime mold population is ; S232: randomly generate the initial position of each slime mold in the first slime mold population according to the objective function of the fire station layout integer programming model to obtain a first initial position matrix ; ; in, Indicates that the first slime mold population i The initial position of the slime mold is j Components on the dimensions of the search space; ; S233, using the objective function of the fire station layout integer programming model as the fitness function of the first slime mold population; S234, start iteration, before iteration, set the first current iteration number d 2 is set to 1; in the first round of iteration, the fitness function of the first slime mold population is used to calculate the fitness value of each initial position in the first initial position matrix to obtain a first fitness value set; the maximum fitness value in the first fitness value set and the initial position of the corresponding slime mold are respectively used as the first global optimal fitness and the first global optimal position; according to the first global optimal fitness and the first global optimal position and in conjunction with the constraint condition group of the fire station layout integer programming model, each initial position in the first initial position matrix is ​​updated; after the update is completed, the first current iteration number is d 2 plus 1 and enter the next round of iteration; In each other round of iteration, the fitness function of the first slime mold population is used to calculate the fitness value of the position of each slime mold updated in the previous round of iteration to obtain a second fitness value set; the maximum fitness value in the second fitness value set and the initial position of the corresponding slime mold are respectively used as the second global optimal fitness and the second global optimal position; the position of each slime mold updated in the previous round of iteration is updated again according to the second global optimal fitness and the second global optimal position and in conjunction with the constraint condition group of the fire station layout integer programming model; after the update is completed, the first current iteration number is d 2 plus 1 and enter the next round of iteration; S235, when When , stop the iteration and get the first final global optimal position; otherwise, continue to iterate until The fire station construction points in the fire station construction point set corresponding to the position component of 0 in the first final global optimal position are eliminated to obtain a preliminary fire station construction point set; The slime mold optimization algorithm can quickly find the optimal solution or approximate optimal solution by simulating the biological oscillator and cytoplasm flow of slime mold; it is relatively insensitive to the quality of the initial solution and the selection of algorithm parameters, and combines the search strategy of exploration and development, which helps to jump out of the local optimal solution and improve the global search capability; based on the above advantages, in this scheme, the slime mold optimization algorithm is used to perform multiple iterative optimizations on multiple 0-1 undetermined coefficients of the integer programming model of the fire station layout, and the objective function is directly used as the fitness function; therefore, as the iteration proceeds, it can maximize its objective function while satisfying the corresponding set of constraints.

[0009] Preferably, S3 comprises the following steps: S31, counting multiple fire accident occurrence points in the fire station construction area to obtain a fire occurrence point set , Indicates the statistically obtained i Fire accident site, Represents the total number of fire accident occurrence points obtained by statistics; constructs a road network diagram between each fire occurrence point in the fire occurrence point set and each fire station construction point in the preliminary fire station construction point set, and obtains a road network diagram matrix e ;as follows, ; in, e ij Indicates the first selected fire station construction site i The number of fire station construction sites and fire occurrence sites is concentrated j A road network diagram between the fire occurrence points; S32, calculating the shortest path length in each network diagram in the road network diagram matrix, and obtaining the shortest path length data matrix ;as follows, ; in, Indicates the first selected fire station construction site i The number of fire station construction sites and fire occurrence sites is concentrated j The shortest path length data in the road network graph between the fire occurrence points; Since the roads in the city are complex and dense, and the fire station needs to arrive at the fire accident scene in time when performing firefighting operations, the shorter the path between the fire station and the fire point, the better; therefore, this solution uses the data structure of the graph to simulate the city's roads, and then solves the shortest path of each road network graph based on the graph theory, that is, solves the shortest path between each fire station construction point and each fire point, which provides a screening basis for the subsequent final screening of the fire station construction points.

[0010] Preferably, counting multiple fire accident occurrence points in the fire station construction area in S31 to obtain a fire occurrence point set includes the following steps: S311. Set the type set of factors affecting the occurrence of fire accidents , Indicates the setting i Types of factors influencing the occurrence of fire accidents, Indicates the total number of factors affecting the occurrence of fire accidents; According to the fire accident influencing factor type set, data on fire accident influencing factors corresponding to multiple locations where fire accidents have occurred in the past and where no fire accidents have occurred are collected to obtain a historical fire accident influencing factor data matrix g 1 and historical fire accident label dataset ，g 2i Indicates the collected i The fire accident label data corresponding to each location, Indicates the total number of locations collected; g 1 is as follows, ; in, g 1ij Indicates the collected i Location j Data on factors affecting the occurrence of various types of fire accidents; S312, constructing an initial SVM classification model; using the fire accident occurrence label data set and the fire accident occurrence influencing factor data matrix to train and test the initial SVM classification model; after the training and testing are completed, the final SVM classification model is obtained; S313, select several locations in the fire station construction area to collect data on factors affecting the occurrence of fire accidents, and obtain a data matrix of factors affecting the occurrence of fire accidents g 3; as follows, ; in, g 3ij Indicates the first i Location j Data on factors affecting the occurrence of fire accidents of various types, represents the total number of sites selected in the fire station construction area; Each row of data in the data matrix of the factors affecting the occurrence of the current fire accident is input into the final SVM classification model for classification to obtain the current fire accident label data set , g 4i Indicates the first i The fire accident label data is obtained by classifying the influencing factors of fire accidents at each location; S314, selecting the fire accident occurrence label data corresponding to the fire accident that has occurred in the current fire accident occurrence label data set, and merging the selected locations in the corresponding fire station construction area to obtain a fire occurrence point set; The types of influencing factors for fire accidents mainly include human factors, such as stoves not being turned off in time when cooking and electrical equipment being overloaded for a long time, natural factors, such as high temperature, drought, windy weather conditions that increase the risk of fire, and facility and equipment factors, such as cable aging, circuit overload, short circuit, etc., which may cause fires; by collecting data on influencing factors for fire accidents corresponding to multiple locations where fire accidents have occurred in the past and where no fire accidents have occurred, data support is provided for the subsequent construction of the final SVM classification model that can map the data on influencing factors for fire accidents to the corresponding fire accidents; by constructing the final SVM classification model, a model tool is provided for the subsequent classification and mapping of the data on influencing factors for fire accidents in multiple current locations, and multiple locations with the possibility of fire occurring are screened out.

[0011] Preferably, the S32 comprises the following steps: S321, traverse each road network graph in the road network graph matrix, and construct an adjacency matrix corresponding to the currently traversed road network graph, recorded as the current adjacency matrix ;as follows, ; in, Indicates the current traversal of the road network graph. i The node and j The path length between nodes is =0, indicating that the current traversal of the road network graph is i The node and j There are no road connections between the nodes; S322. Construction of the second slime mold population , Indicates the first i Only slime mold, represents the size of the second slime mold population; sets the maximum number of iterations of the second slime mold population to d 3. The current number of iterations is d 4, respectively, are recorded as the second maximum number of iterations and the second current number of iterations; the search space dimension of the second slime mold population is ; S323, setting the starting point and the end point of the currently traversed road network graph, respectively recording them as the current starting point and the current end point; setting the initial position of each slime mold in the second slime mold population according to the current starting point and the current end point, to obtain a second initial position matrix ;as follows, ; in, Indicates that the second slime mold population iThe initial position of the slime mold is j The search space dimensions, ;when =0, indicating that the currently generated path does not include the first j Nodes, when =1, indicating that the currently generated path includes the first j nodes; S324: According to the second initial position matrix And the current adjacency matrix Constructing the second slime mold population i Fitness function of slime mold f i ;as follows, ; In the formula, β A positive number indicates a correction parameter; S325, start iteration, before iteration, set the second current iteration number d 4 is set to 1; in the first round of iteration, the second slime mold population is used. i Fitness function of slime mold f i , i =1,2,..., Calculate the fitness value of each initial position in the second initial position matrix to obtain a third fitness value set; use the maximum fitness value in the third fitness value set and the corresponding initial position of the slime mold as the third global optimal fitness and the third global optimal position respectively; update each initial position in the second initial position matrix according to the third global optimal fitness and the third global optimal position; after the update is completed, the second current iteration number d 4 plus 1 and enter the next round of iteration; In each other round of iteration, the second slime mold population is used. i Fitness function of slime mold f i , i =1,2,..., Calculate the fitness value of each slime mold position updated in the previous round of iterations to obtain a fourth fitness value set; use the maximum fitness value in the fourth fitness value set and the initial position of the corresponding slime mold as the fourth global optimal fitness and the fourth global optimal position respectively; update the position of each slime mold updated in the previous round of iterations according to the fourth global optimal fitness and the fourth global optimal position; after the update is completed, the second current iteration number d 4 plus 1 and enter the next round of iteration; S326, when When , stop the iteration and get the second final global best position and the corresponding second final global best fitness; otherwise, continue to iterate until The second final global optimal fitness is used as the shortest path length data of the road network graph currently traversed; S327, when each road network graph in the road network graph matrix is ​​traversed, a shortest path length data matrix is ​​obtained; In this scheme, the slime mold optimization algorithm is used to perform multiple iterative optimizations on the selection of each road network graph in the road network graph matrix, and the total length of the paths connecting the selected points is used as the fitness function; therefore, as the iterations proceed, the total length of the paths connecting the nodes selected from each road network graph is the smallest, which provides a screening basis for the subsequent final screening of fire station construction points.

[0012] Preferably, S4 comprises the following steps: S41, calculating the shortest path length data matrix The average value of each row of data in the shortest path length average data set is obtained , Indicates the first selected fire station construction site i The average value of the shortest path length data between the fire station construction point and each fire occurrence point in the fire occurrence point set; the calculation formula is as follows: ; S42. Select the fire station construction points in the preliminary fire station construction point set corresponding to several shortest path length average data with the largest data values ​​in the shortest path length average data set as the final fire station construction points to obtain the final fire station construction point set.

[0013] A fire station and national land space integrated layout decision support system includes a fire station layout factor type setting module, a historical layout cost factor data collection module, a historical layout construction cycle factor data evaluation module, a planning model building module, a planning model solving module, a road network diagram building module, a shortest path calculation module, an average short path length data calculation module and a final screening module.

[0014] The present invention has the following beneficial effects: 1. The present invention takes comprehensive consideration from two aspects, construction cost and construction period, so that the fire station can better meet various requirements after construction; by solving the integer programming model of the fire station layout, it can be solved where the fire station needs to be built, so that its cost is within the budget and its total construction period is minimized; by constructing a road network diagram between each fire station construction point and multiple fire station construction points in the preliminary fire station construction point concentration, if the shortest path length between the fire station construction point and the fire accident occurrence point is too long, it will lead to low rescue efficiency; therefore, in this scheme, the fire station construction points are finally screened again according to the shortest path length data between each fire station construction point and multiple fire accident occurrence points, so as to further ensure the rationality and accuracy of the layout of the constructed fire station.

[0015] 2. The present invention constructs a final SVM classification model, which provides a model tool for subsequent classification and mapping of the data of factors affecting the occurrence of fire accidents in multiple locations, thereby screening out multiple locations where fires are likely to occur.

[0016] 3. In the present invention, the slime mold optimization algorithm is used to perform multiple iterative optimizations on the selection of each road network graph in the road network graph matrix, and the total length of the paths connecting the selected points is used as the fitness function; therefore, as the iterations proceed, the total length of the paths connecting the nodes selected from each road network graph is the smallest, which provides a screening basis for the subsequent final screening of the fire station construction points.

[0017] Of course, any product implementing the present invention does not necessarily need to achieve all of the advantages described above at the same time. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the invention, the drawings required for describing the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the invention. For ordinary technicians in this field, they can also obtain drawings based on these drawings without paying creative work.

[0019] Figure 1 The present invention is a flowchart of a decision support method for the integrated layout of fire stations and national land space. DETAILED DESCRIPTION

[0020] The following will be combined with the drawings in the embodiments of the invention to clearly and completely describe the technical solutions in the embodiments of the invention. Obviously, the described embodiments are only part of the embodiments of the invention, not all of the embodiments. Based on the embodiments in the invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the invention.

[0021] In the description of the present invention, it is necessary to understand that the terms "opening", "upper", "lower", "top", "middle", "inside" and the like indicating orientation or positional relationship are only for the convenience of describing the invention and simplifying the description, and do not indicate or imply that the components or elements referred to must have a specific orientation, be constructed and operate in a specific orientation, and therefore cannot be understood as limiting the invention.

[0022] Embodiment 1

[0023] This embodiment is a decision support method for the integrated layout of fire stations and national land space, including the following steps: S1. Set multiple fire station layout cost factor types and fire station layout construction cycle factor types to obtain a fire station layout cost factor type set and a fire station layout construction cycle factor type set; collect cost factor data of multiple fire station construction points according to the fire station layout cost factor type set to obtain a cost factor data matrix; evaluate the construction cycle factor data of multiple fire station construction points according to the fire station layout construction cycle factor type set to obtain a construction cycle factor data matrix; The S1 comprises the following steps: S11. Set a fire station construction area, set a number of fire station construction points in the fire station construction area, and obtain a fire station construction point set. , a i Indicates the setting i Fire station construction sites, Indicates the total number of fire station construction sites set; Set multiple fire station layout cost factor types and fire station layout construction period factor types to obtain a fire station layout cost factor type set And the fire station layout construction cycle factor type set ; , , , They represent land cost factor type, construction cost factor type, equipment cost factor type, maintenance cost factor type, and labor cost factor type, respectively. Indicates the setting i Types of factors in the construction period of fire station layout, b Indicates the total number of set fire station layout construction cycle factor types; S12, collecting cost factor data of each fire station construction point in the fire station construction point set according to the fire station layout cost factor type set, and obtaining a cost factor data matrix ; Then, according to the fire station layout construction cycle factor type set, the construction cycle factor data of each fire station construction point in the fire station construction point set is evaluated to obtain the construction cycle factor data matrix ; , They are as follows: ; ; in, , , , , They represent the concentration of the fire station construction points. i The land cost factor data, construction cost factor data, equipment cost factor data, maintenance cost factor data and labor cost factor data of each fire station construction site; Indicates that the fire station construction point is concentrated in the first i The first fire station construction site j Types of construction cycle factor data; S2. constructing a fire station layout integer programming model according to the cost factor data matrix and the construction period factor data matrix; solving the fire station layout integer programming model to obtain a preliminary fire station construction point set; The S2 comprises the following steps: S21. Set the total budget of each type of fire station layout cost factor in the fire station layout cost factor type set when building a fire station, and obtain a total budget data set for the fire station layout. , , , , , They respectively represent the total budget data of land cost factors, the total budget data of construction cost factors, the total budget data of equipment cost factors, the total budget data of maintenance cost factors, and the total budget data of labor cost factors; S22, constructing a fire station layout integer programming model based on the total budget data set of the fire station layout, the construction period factor data matrix and the cost factor data matrix; the objective function of the fire station layout integer programming model is as follows: ; In the formula, Indicates the total construction period of the fire station under construction; Indicates the setting i Undetermined coefficients, ; The constraints of the integer programming model for fire station layout are as follows: ; S23, solving the fire station layout integer programming model to obtain a preliminary fire station construction point set , c 1i represents the first i Fire station construction sites, represents the total number of fire station construction points obtained by solving the fire station layout integer programming model; The S23 comprises the following steps: S231. Construction of the first slime mold population , represents the first i Only slime mold, represents the size of the first slime mold population; sets the maximum number of iterations of the first slime mold population to d 1. The current number of iterations is d 2, respectively, are recorded as the first maximum number of iterations and the first current number of iterations; the search space dimension of the first slime mold population is ; S232: randomly generate the initial position of each slime mold in the first slime mold population according to the objective function of the fire station layout integer programming model to obtain a first initial position matrix ; ; in, Indicates that the first slime mold population i The initial position of the slime mold is j Components on the dimensions of the search space; ; S233, using the objective function of the fire station layout integer programming model as the fitness function of the first slime mold population; S234, start iteration, before iteration, set the first current iteration number d 2 is set to 1; in the first round of iteration, the fitness function of the first slime mold population is used to calculate the fitness value of each initial position in the first initial position matrix to obtain a first fitness value set; the maximum fitness value in the first fitness value set and the initial position of the corresponding slime mold are respectively used as the first global optimal fitness and the first global optimal position; according to the first global optimal fitness and the first global optimal position and in conjunction with the constraint condition group of the fire station layout integer programming model, each initial position in the first initial position matrix is ​​updated; after the update is completed, the first current iteration number is d 2 plus 1 and enter the next round of iteration; In each other round of iteration, the fitness function of the first slime mold population is used to calculate the fitness value of the position of each slime mold updated in the previous round of iteration to obtain a second fitness value set; the maximum fitness value in the second fitness value set and the initial position of the corresponding slime mold are respectively used as the second global optimal fitness and the second global optimal position; the position of each slime mold updated in the previous round of iteration is updated again according to the second global optimal fitness and the second global optimal position and in conjunction with the constraint condition group of the fire station layout integer programming model; after the update is completed, the first current iteration number is d 2 plus 1 and enter the next round of iteration; S235, when When , stop the iteration and get the first final global optimal position; otherwise, continue to iterate until The fire station construction points in the fire station construction point set corresponding to the position component of 0 in the first final global optimal position are eliminated to obtain a preliminary fire station construction point set; S3, constructing a road network diagram between each fire station construction point in the preliminary fire station construction point set and multiple fire accident occurrence points to obtain a road network diagram matrix; calculating the shortest path length of each road network diagram in the road network diagram matrix to obtain a shortest path length data matrix; The S3 comprises the following steps: S31, counting multiple fire accident occurrence points in the fire station construction area to obtain a fire occurrence point set , Indicates the statistically obtained i Fire accident site, Represents the total number of fire accident occurrence points obtained by statistics; constructs a road network diagram between each fire occurrence point in the fire occurrence point set and each fire station construction point in the preliminary fire station construction point set, and obtains a road network diagram matrix e ;as follows, ; in, e ij Indicates the first selected fire station construction site i The number of fire station construction sites and fire occurrence sites is concentrated j A road network diagram between the fire occurrence points; In S31, counting multiple fire accident occurrence points in the fire station construction area to obtain a fire occurrence point set includes the following steps: S311. Set the type set of factors affecting the occurrence of fire accidents , Indicates the setting i Types of factors influencing the occurrence of fire accidents, Indicates the total number of factors affecting the occurrence of fire accidents; According to the fire accident influencing factor type set, data on fire accident influencing factors corresponding to multiple locations where fire accidents have occurred in the past and where no fire accidents have occurred are collected to obtain a historical fire accident influencing factor data matrix g 1 and historical fire accident label dataset , g 2i Indicates the collected i The fire accident label data corresponding to each location, Indicates the total number of locations collected; g 1 is as follows, ; in, g 1ij Indicates the collected i Location j Data on factors affecting the occurrence of various types of fire accidents; S312, constructing an initial SVM classification model; using the fire accident occurrence label data set and the fire accident occurrence influencing factor data matrix to train and test the initial SVM classification model; after the training and testing are completed, the final SVM classification model is obtained; S313, select several locations in the fire station construction area to collect data on factors affecting the occurrence of fire accidents, and obtain a data matrix of factors affecting the occurrence of fire accidents g 3; as follows, ; in, g 3ij Indicates the first i Location j Data on factors affecting the occurrence of fire accidents of various types, represents the total number of sites selected in the fire station construction area; Each row of data in the data matrix of the factors affecting the occurrence of the current fire accident is input into the final SVM classification model for classification to obtain the current fire accident label data set , g 4i Indicates the first i The fire accident label data is obtained by classifying the influencing factors of fire accidents at each location; S314, selecting the fire accident occurrence label data corresponding to the fire accident that has occurred in the current fire accident occurrence label data set, and merging the selected locations in the corresponding fire station construction area to obtain a fire occurrence point set; S32, calculating the shortest path length in each network diagram in the road network diagram matrix, and obtaining the shortest path length data matrix ;as follows, ; in, Indicates the first selected fire station construction site i The number of fire station construction sites and fire occurrence sites is concentrated j The shortest path length data in the road network graph between the fire occurrence points; The S32 comprises the following steps: S321, traverse each road network graph in the road network graph matrix, and construct an adjacency matrix corresponding to the currently traversed road network graph, recorded as the current adjacency matrix ;as follows, ; in, Indicates the current traversal of the road network graph. i The node and j The path length between nodes is =0, indicating that the current traversal of the road network graph is i The node and j There are no road connections between the nodes; S322. Construction of the second slime mold population , Indicates the first i Only slime mold, represents the size of the second slime mold population; sets the maximum number of iterations of the second slime mold population to d 3. The current number of iterations is d 4, respectively, are recorded as the second maximum number of iterations and the second current number of iterations; the search space dimension of the second slime mold population is ; S323, setting the starting point and the end point of the currently traversed road network graph, respectively recording them as the current starting point and the current end point; setting the initial position of each slime mold in the second slime mold population according to the current starting point and the current end point, to obtain a second initial position matrix ;as follows, ; in, Indicates that the second slime mold population iThe initial position of the slime mold is j The search space dimensions, ;when =0, indicating that the currently generated path does not include the first j Nodes, when =1, indicating that the currently generated path includes the first j nodes; S324: According to the second initial position matrix And the current adjacency matrix Constructing the second slime mold population i Fitness function of slime mold f i ;as follows, ; In the formula, β A positive number indicates a correction parameter; S325, start iteration, before iteration, set the second current iteration number d 4 is set to 1; in the first round of iteration, the second slime mold population is used. i Fitness function of slime mold f i , i =1,2,..., Calculate the fitness value of each initial position in the second initial position matrix to obtain a third fitness value set; use the maximum fitness value in the third fitness value set and the corresponding initial position of the slime mold as the third global optimal fitness and the third global optimal position respectively; update each initial position in the second initial position matrix according to the third global optimal fitness and the third global optimal position; after the update is completed, the second current iteration number d 4 plus 1 and enter the next round of iteration; In each other round of iteration, the second slime mold population is used. i Fitness function of slime mold f i , i =1,2,..., Calculate the fitness value of each slime mold position updated in the previous round of iterations to obtain a fourth fitness value set; use the maximum fitness value in the fourth fitness value set and the initial position of the corresponding slime mold as the fourth global optimal fitness and the fourth global optimal position respectively; update the position of each slime mold updated in the previous round of iterations according to the fourth global optimal fitness and the fourth global optimal position; after the update is completed, the second current iteration number d 4 plus 1 and enter the next round of iteration; S326, when When , stop the iteration and get the second final global best position and the corresponding second final global best fitness; otherwise, continue to iterate until The second final global optimal fitness is used as the shortest path length data of the road network graph currently traversed; S327, when each road network graph in the road network graph matrix is ​​traversed, a shortest path length data matrix is ​​obtained; S4, calculating the average shortest path length data of each fire station construction point in the shortest path length data matrix to obtain an average shortest path length data set; performing a final screening on the preliminary selected fire station construction point set according to the average shortest path length data set to obtain a final fire station construction point set; The S4 comprises the following steps: S41, calculating the shortest path length data matrix The average value of each row of data in the shortest path length average data set is obtained , Indicates the first selected fire station construction site i The average value of the shortest path length data between the fire station construction point and each fire occurrence point in the fire occurrence point set; the calculation formula is as follows: ; S42. Select the fire station construction points in the preliminary fire station construction point set corresponding to several shortest path length average data with the largest data values ​​in the shortest path length average data set as the final fire station construction points to obtain the final fire station construction point set.

[0024] Embodiment 2 This embodiment discloses a fire station and national land space integrated layout decision support system, the system can implement the method of the above embodiment, including a fire station layout factor type setting module, a historical layout cost factor data collection module, a historical layout construction cycle factor data evaluation module, a planning model construction module, a planning model solving module, a road network diagram construction module, a shortest path calculation module, an average short path length data calculation module and a final screening module; The fire station layout factor type setting module is used to set multiple fire station layout cost factor types and fire station layout construction period factor types to obtain a fire station layout cost factor type set and a fire station layout construction period factor type set; The historical layout cost factor data collection module is used to collect cost factor data of multiple fire station construction points according to the fire station layout cost factor type set to obtain a cost factor data matrix; The historical layout construction cycle factor data evaluation module is used to evaluate the construction cycle factor data of multiple fire station construction points according to the fire station layout construction cycle factor type set to obtain a construction cycle factor data matrix; The planning model building module is used to build a fire station layout integer programming model according to the cost factor data matrix and the construction period factor data matrix; The planning model solving module is used to solve the fire station layout integer programming model to obtain a preliminary set of fire station construction points; The road network graph construction module is used to construct a road network graph between each fire station construction point in the preliminary selected fire station construction point set and multiple fire station construction points to obtain a road network graph matrix; The shortest path calculation module is used to calculate the shortest path length of each road network graph in the road network graph matrix to obtain a shortest path length data matrix; The average short path length data calculation module is used to calculate the average shortest path length data of each fire station construction point in the shortest path length data matrix to obtain the shortest path length average data set; The final screening module is used to perform a final screening on the preliminary selected fire station construction point set according to the shortest path length average data set to obtain a final fire station construction point set.

[0025] In the description of this specification, the description with reference to the terms "one embodiment", "example", "specific example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0026] The preferred embodiments of the invention disclosed above are only used to help explain the invention. The preferred embodiments do not describe all the details in detail, nor do they limit the invention to the specific implementation methods described. Obviously, many modifications and changes can be made according to the content of this specification. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the invention, so that those skilled in the art can understand and use the invention well.

Claims

1. A decision support method for the integrated layout of fire stations and national land space, characterized in that: The following steps are involved: S1. Set multiple fire station layout cost factor types and fire station layout construction cycle factor types to obtain a fire station layout cost factor type set and a fire station layout construction cycle factor type set; collect cost factor data of multiple fire station construction points according to the fire station layout cost factor type set to obtain a cost factor data matrix; evaluate the construction cycle factor data of multiple fire station construction points according to the fire station layout construction cycle factor type set to obtain a construction cycle factor data matrix; S2. constructing a fire station layout integer programming model according to the cost factor data matrix and the construction period factor data matrix; solving the fire station layout integer programming model to obtain a preliminary fire station construction point set; S3, constructing a road network diagram between each fire station construction point in the preliminary fire station construction point set and multiple fire accident occurrence points to obtain a road network diagram matrix; calculating the shortest path length of each road network diagram in the road network diagram matrix to obtain a shortest path length data matrix; S4, calculating the average shortest path length data of each fire station construction point in the shortest path length data matrix to obtain an average shortest path length data set; The preliminary fire station construction point set is finally screened according to the shortest path length average data set to obtain a final fire station construction point set.

2. According to claim 1, a fire station and land space integrated layout decision support method is characterized in that: The S1 comprises the following steps: S11. Set a fire station construction area, set a number of fire station construction points in the fire station construction area, and obtain a fire station construction point set; set a number of fire station layout cost factor types and fire station layout construction period factor types, and obtain a fire station layout cost factor type set and a fire station layout construction period factor type set; S12. Collect cost factor data of each fire station construction point in the fire station construction point set according to the fire station layout cost factor type set to obtain a cost factor data matrix; then evaluate the construction cycle factor data of each fire station construction point in the fire station construction point set according to the fire station layout construction cycle factor type set to obtain a construction cycle factor data matrix.

3. According to claim 2, a fire station and land space integrated layout decision support method is characterized in that: The S2 comprises the following steps: S21, setting a total budget for each type of fire station layout cost factor in the fire station layout cost factor type set when constructing a fire station, and obtaining a fire station layout total budget data set; S22, constructing a fire station layout integer programming model according to the fire station layout total budget data set, the construction period factor data matrix, and the cost factor data matrix; S23. Solve the fire station layout integer programming model to obtain a preliminary set of fire station construction points.

4. According to claim 3, a fire station and land space integrated layout decision support method is characterized by: In S23, the slime mold optimization algorithm is used to solve the fire station layout integer programming model.

5. According to claim 4, a fire station and land space integrated layout decision support method is characterized in that: The S3 comprises the following steps: S31, counting multiple fire accident occurrence points in the fire station construction area to obtain a fire occurrence point set; constructing a road network diagram between each fire occurrence point in the fire occurrence point set and each fire station construction point in the preliminary fire station construction point set to obtain a road network diagram matrix; S32, calculating the shortest path length in each network graph in the road network graph matrix to obtain a shortest path length data matrix.

6. A fire station and land space integrated layout decision support method according to claim 5, characterized in that: In S31, counting multiple fire accident occurrence points in the fire station construction area to obtain a fire occurrence point set includes the following steps: S311, setting a type set of factors affecting the occurrence of fire accidents; collecting data on factors affecting the occurrence of fire accidents corresponding to multiple locations where fire accidents have occurred in the past and locations where fire accidents have not occurred according to the type set of factors affecting the occurrence of fire accidents, to obtain a data matrix of factors affecting the occurrence of historical fire accidents and a data set of labels for the occurrence of historical fire accidents; S312, constructing an initial SVM classification model; using the fire accident occurrence label data set and the fire accident occurrence influencing factor data matrix to train and test the initial SVM classification model; after the training and testing are completed, the final SVM classification model is obtained; S313: Using the final SVM classification model, the data of factors affecting the occurrence of fire accidents in multiple cities are classified and screened to obtain a set of fire occurrence points.

7. A fire station and land space integrated layout decision support method according to claim 6, characterized in that: The S313 comprises the following steps: S3131, select several locations in the fire station construction area to collect data on factors affecting the occurrence of fire accidents, and obtain a data matrix of factors affecting the occurrence of current fire accidents; input each row of data in the data matrix of factors affecting the occurrence of current fire accidents into the final SVM classification model for classification, and obtain a current fire accident occurrence label data set; S3132. Select the fire accident occurrence label data corresponding to the fire accident that has occurred in the current fire accident occurrence label data set, and merge the selected locations in the corresponding fire station construction area to obtain a fire occurrence point set.

8. A decision support method for integrated layout of fire stations and national land space according to claim 7, characterized in that: The S32 comprises the following steps: S321, traversing each road network graph in the road network graph matrix, constructing an adjacency matrix corresponding to the currently traversed road network graph, recorded as the current adjacency matrix; S322, constructing a second slime mold population; setting the maximum number of iterations of the second slime mold population to d 3. The current number of iterations is d 4, respectively recorded as the second maximum number of iterations and the second current number of iterations; S323, setting the starting point and the end point of the currently traversed road network graph, which are recorded as the current starting point and the current end point respectively; setting the initial position of each slime mold in the second slime mold population according to the current starting point and the current end point, to obtain a second initial position matrix; S324, constructing a fitness function for each slime mold in the second slime mold population according to the second initial position matrix and the current adjacency matrix; S325, start iteration; in each round of iteration, use the fitness function of each slime mold in the second slime mold population to calculate the fitness value of each slime mold position updated in the previous round of iteration, and update the position of each slime mold updated in the previous round of iteration again; S326, when When , stop the iteration and get the second final global best position and the corresponding second final global best fitness; otherwise, continue to iterate until The second final global optimal fitness is used as the shortest path length data of the road network graph currently traversed; S327. When each road network graph in the road network graph matrix is ​​traversed, a shortest path length data matrix is ​​obtained.

9. A fire station and land space integrated layout decision support method according to claim 8, characterized in that: The S4 comprises the following steps: S41, calculating the average value of each row of data in the shortest path length data matrix to obtain a shortest path length average data set; S42. Select the fire station construction points in the preliminary fire station construction point set corresponding to several shortest path length average data with the largest data values ​​in the shortest path length average data set as the final fire station construction points to obtain the final fire station construction point set.

10. A system for implementing a decision support method for the integrated layout of fire stations and national land space as described in any one of claims 1 to 9.

Images