CN112035987B - Method, device and storage medium for calculating ventilation network of multi-fan and multi-stage station - Google Patents

Abstract

The invention discloses a method, a device and a storage medium for calculating the ventilation network of a multi-fan and multi-stage machine station. Wherein, the method includes: creating a spanning tree for a ventilation network of a multi-fan and multi-stage machine station, and obtaining a set of residual tree branches of the spanning tree; And build a conflicting residual tree branch set; add the residual tree branch that has been delineated to a closed loop to the spanning tree to generate a network graph; traverse each conflicting residual tree branch in the conflicting residual tree branch set, update the network graph , obtain the minimum independent closed loop; perform iterative operation on the minimum independent closed loop to obtain the solution result of the ventilation network.

Description

Method, device and storage medium for calculating ventilation network of multi-fan and multi-stage station

technical field

The invention relates to the field of mine ventilation, in particular to a method, device and storage medium for calculating a ventilation network of a multi-fan and multi-stage machine station.

Background technique

With the development of the mining industry, the scale of ore deposits is getting larger and larger, especially the application of the multi-fan multi-stage ventilation method, the scale of the mine ventilation system is also expanding, and the complexity is increasing.

In the related art, many mines have extremely serious underground circulating wind phenomenon due to chaotic fan management. The traditional ventilation network solution method requires the fan branch to be a co-tree branch to avoid multiple fan branches in the same circuit. However, in the multi-fan multi-level station ventilation network solution, it is not only possible that multiple fan branches appear in the same circuit. , and many logically related fans are prone to appear, which will cause certain interference to the fan optimization of multi-stage stations. In addition, the iterative process of solving the ventilation network of multi-fan and multi-stage stations has slow convergence and even tends to diverge.

SUMMARY OF THE INVENTION

In view of this, the embodiments of the present invention provide a method, device, and storage medium for calculating the ventilation network of a multi-fan and multi-stage station, aiming to optimize the iterative convergence rate of the method for calculating the ventilation network of a multi-fan and multi-stage station, and predict different The effect of downhole air volume distribution of control measures.

The technical solution of the embodiment of the present invention is realized as follows:

In a first aspect, an embodiment of the present invention provides a method for calculating a ventilation network of a multi-fan and multi-stage station, including:

Create a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtain a set of remaining tree branches of the spanning tree;

Based on each co-tree branch in the co-tree branch set, a closed loop is drawn, and a conflicting co-tree branch set is constructed;

Add the co-tree branches that have been delineated closed loops to the spanning tree to generate a network graph;

Traverse each conflicting residual tree branch in the conflicting residual tree branch set, update the network graph, and obtain a minimum independent closed loop;

An iterative operation is performed on the minimum independent closed loop to obtain the solution result of the ventilation network.

In the second aspect, the embodiment of the present invention also provides a multi-fan and multi-stage machine station ventilation network calculation device, including:

The first building module is used to create a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtain the remaining tree branch set of the spanning tree;

The second building module is used for delineating a closed loop based on each co-tree branch in the co-tree branch set, and constructing a conflicting co-tree branch set;

The third building module is used to add the co-tree branches that have been delineated and closed loops to the spanning tree to generate a network graph;

a search module, configured to traverse each conflicting redundant tree branch in the conflicting redundant tree branch set, update the network graph, and obtain a minimum independent closed loop;

A solution module is configured to perform an iterative operation on the minimum independent closed loop to obtain a solution result of the ventilation network.

In a third aspect, an embodiment of the present invention further provides a multi-fan and multi-stage ventilation network solution device, including: a processor and a memory for storing a computer program that can be executed on the processor, wherein the processing The device is configured to execute the steps of the methods described in the embodiments of the present invention when running the computer program.

In a fourth aspect, an embodiment of the present invention further provides a storage medium, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, the steps of the method described in the embodiment of the present invention are implemented.

According to the technical solution provided by the embodiments of the present invention, by determining the minimum independent closed loop of the ventilation network of the multi-fan and multi-stage station, and performing iterative operation on the minimum independent closed loop, the calculation result of the ventilation network can be obtained, which can improve the performance of the ventilation network. The iterative convergence rate of the multi-fan and multi-stage ventilation network solution method is helpful for predicting the effect of downhole air volume distribution of different control measures.

Description of drawings

1 is a schematic flowchart of a method for calculating a ventilation network of a multi-fan and multi-stage machine station according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of the principle of a closed-loop loop drawing in an embodiment of the present invention;

3 is a schematic flowchart of searching for conflicting residual tree branches in an application example of the present invention;

FIG. 4 is a schematic flowchart of searching for a minimum independent closed loop in an application example of the present invention;

5A to 5D are schematic structural diagrams of four mine ventilation network models in an application example of the present invention;

6 is a schematic structural diagram of a multi-fan multi-stage machine station ventilation network calculation device according to an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of a multi-fan multi-stage machine station ventilation network calculation device according to an embodiment of the present invention.

Detailed ways

The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terms used herein in the description of the present invention are for the purpose of describing specific embodiments only, and are not intended to limit the present invention.

The embodiment of the present invention provides a method for calculating the ventilation network of a multi-fan and multi-stage station, as shown in FIG. 1 , including:

Step 101, creating a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtaining a set of remaining tree branches of the spanning tree;

Step 102, based on each co-tree branch in the co-tree branch set, circle a closed loop, and construct a conflicting co-tree branch set;

Step 103, adding the remaining tree branches that have been delineated and closed loops to the spanning tree to generate a network graph;

Step 104, traverse each conflicting residual tree branch in the conflicting residual tree branch set, update the network graph, and obtain a minimum independent closed loop;

Step 105: Perform an iterative operation on the minimum independent closed loop to obtain a solution result of the ventilation network.

In the embodiment of the present invention, the minimum independent closed loop of the ventilation network of the multi-fan and multi-stage machine station can be determined, and the minimum independent closed loop can be iteratively calculated to obtain the calculation result of the ventilation network, which can improve the multi-fan and multi-stage machine station. The iterative convergence rate of the station ventilation network solution method is conducive to predicting the effect of downhole air volume distribution of different control measures.

Here, the minimum independent closed loop can be iteratively calculated based on the Hardy Cross iteration method, so that the loop voltage drop tends to zero. When the iterative calculation process reaches the specified calculation accuracy, the air volume distribution result of the ventilation network solution is obtained.

In practical applications, the quality of the loop circle directly affects the speed and performance of iterative convergence. In order to achieve the purpose of making the sum of the non-main diagonal elements much smaller than the main diagonal elements, the optimal loop should have the following characteristics:

1), try to increase the weight of the main diagonal elements;

2), try to reduce the number of non-main diagonal elements;

3), establish and reduce the size of non-main diagonal elements;

4) Minimize the number of shared branches of each loop to avoid mutual interference between loops.

Based on this, in the embodiment of the present invention, a loop air volume calculation method based on the minimum independent closed loop is proposed. Here, the main differences between the minimum independent closed loop and the existing independent loop include: the minimum independent closed loop allows multiple co-tree branches to be included in the same closed loop; the minimum independent closed loop The nature of the holes can reduce the number of branches in the loop and minimize the sum of the weights of non-co-tree branches; in addition, as shown in Figure 2, since the fans can be distributed in different closed loops as much as possible, the fan iteration tends to converge, therefore, The minimum independent closed loop is more conducive to the solution of multi-fan and multi-stage stations.

Exemplarily, each branch in the ventilation network can be divided into the following three categories: fixed air volume branch, fan branch and general roadway branch. Since the fan branch has a great influence on the iterative calculation, the fan branch can be used as a co-tree branch. However, in the multi-level machine station solution, the fan branches will also appear in the branches. In order to reduce the occurrence of fans in multiple circuits, the branch of the fan can be regarded as a co-tree branch to search for the smallest closed loop containing only one co-tree branch, so as to reduce the influence of multiple fans in the same circuit.

It should be noted that, in this embodiment of the present invention, the minimum independent closed loop search method based on spanning tree is determined based on the following three theorems, and its biggest feature is that the closed loop generated each time is the minimum value of the current cotree branch graph. closed loop.

Theorem 1: For a connected network graph G(V, E), a spanning tree can be formed, and each additional co-tree branch forms a closed loop, and there are at most M=N-J+1 independent closed loops; among them, V is the node set, and E is the branch set. N represents the number of branches, and J represents the number of nodes.

As mentioned above, for a connected ventilation network graph G(V, E), when delineating an independent loop, a tree graph and a corresponding co-tree graph can be obtained, in which there are J-1 tree branches and N-(J- 1), each addition of a co-tree branch in the spanning tree can form a loop (closed loop). Since each loop contains at least one branch that other loops do not have, that is, a co-tree branch, so between every two loops are independent of each other, and the number M of independent circuits delineated by any ventilation network diagram should satisfy the following relational formula M=N-J+1.

Theorem 2: In a series of closed loops added sequentially, each closed loop contains at least one branch that does not exist in the closed loop before it, then these closed loops are independent of each other.

Mathematically prove that: in the ventilation network graph G(V, E) with N branches and J nodes, for the delineated M minimum closed loops, when the direction of the closed loop is specified, the ith closed loop can be expressed as is: C _i =(b _ij ) _i×N . The M independent closed loops constructed according to the above analysis can be formed into an M×N matrix. If the columns where the non-co-tree branches are located in the matrix are removed, row transformation is performed in the order in which the closed loops are added, so that the row number where the closed loop is located is the same as the added column. If the order is the same, the matrix C that constitutes M×M is the familiar upper triangular determinant as shown below, and the M minimum closed loops are independent of each other.

其中，

in,

In addition, in order to ensure that the closed loop satisfies the requirement of the maximum independent loop set, the closed loop of each cotree branch is gradually searched based on the idea of spanning tree.

Theorem 3: When adding co-tree branches, if the closed loop delineated contains only one co-tree branch, it must be an independent closed loop.

Since the closed loop contains only one co-tree branch, it is independent of other closed loops, that is, the closed loop is included in the minimum independent closed loop. Therefore, according to Theorem 3, only closed loops containing multiple cotree branches need to be compared. From the perspective of loop circle drawing, if the shortest path searched by the co-tree branch is a loop, it is added directly, which must be the smallest closed loop.

In some embodiments, based on each co-tree branch in the co-tree branch set, delineating a closed loop, and constructing a conflicting co-tree branch set, comprising:

Traverse each co-tree branch in the co-tree branch set, and delineate each co-tree branch in a closed loop;

If it is determined that the closed loop to be delineated has only one co-tree branch or there are multiple co-tree branches and only the current co-tree branch is not delineated as a closed loop, then the current closed loop is delineated and the current co-tree branch is marked;

If it is determined that there are multiple co-tree branches in the closed loop to be delineated, and at least one co-tree branch delineates the closed loop duplicates with the current closed loop, the current co-tree branch is added to the conflicting co-tree branch set.

Exemplarily, as shown in Figure 3, a spanning tree is created for the ventilation network, and the set of co-tree branches is traversed. If there are multiple co-tree branches when a closed loop is drawn, first traverse and check other co-tree branches in the closed loop. , if the branch has already delineated a closed loop, find the next co-tree branch, otherwise, process it in the same way; when all co-tree branches in the closed loop have been delineated, delineate the closed loop again. According to the above recursive closed loop delineation method, there are three situations: 1) The closed loop delineated has only one co-tree branch; 2) The closed loop delineated has multiple co-tree branches, but all other co-tree branches have been Circle the closed loop; 3) There are multiple cotree branches in the circled closed loop, and at least one cotree branch The circled closed loop is repeated with the current closed loop. If two co-tree branches have the same minimum closed loop, there will be a co-tree branch that cannot determine the minimum closed loop; for the co-tree branch that cannot be judged, it is necessary to define the rules for adding the co-tree branches. By defining the co-tree branch The order of addition avoids this.

In this way, the first two cases can guarantee the independence of delineating closed loops, while in the third case, the repetition of closed loops will lead to omission of independent closed loops. Therefore, it is necessary to add the co-tree branches that repeatedly delineate closed loops. To the set of conflicting cotree branches, it is necessary to define the rules of adding order for the conflicting cotree branches to ensure the independence of the circle and the closed loop.

In some embodiments, traversing each conflicting co-tree branch in the conflicting co-tree branch set, updating the network graph, and obtaining a minimum independent closed loop, including:

For each conflicting co-tree branch in the set of conflicting co-tree branches, adding the conflicting co-tree branch to the network graph;

For each network graph after adding the conflicting residual tree branch, the network graph is repeatedly updated until each of the conflicting residual tree branches is added to the network graph;

The minimum independent closed loop is generated based on the updated network graph.

In some embodiments, the repeatedly updating the network graph for each of the network graphs after adding the conflicting residual tree branches includes:

For the network graph after adding the conflicting co-tree branches, disconnect each co-tree branch respectively, draw a closed loop of each disconnected co-tree branch based on the depth-first search (DFS) method, and add the closed loop with the shortest path length. to the spanning tree as the current minimum closed loop;

Add the conflicting co-tree branch after obtaining the minimum closed loop to the network graph, continue to draw a closed loop based on the DFS method for the remaining co-tree branches, and add the closed loop with the shortest path length to the spanning tree, enriching the the current minimum closed loop.

In some embodiments, the updated network graph generates the minimum independent closed loop, comprising:

Judging whether the updated minimum closed loops in the network graph are independent, and if so, obtain the minimum independent closed loop; Co-tree branches, update the network graph, and obtain the minimum independent closed loop.

In an application example, the search for the minimum independent closed loop based on the MICL (minimum independent closed loops, minimum independent closed loop) search method is shown in Figure 4, which specifically includes:

Step 401, the ventilation network is initialized;

Here, the ventilation network of the multi-fan and multi-stage station is obtained, the parameters of the ventilation network are initially set, and it is checked whether the ventilation network is connected.

Step 402, create a spanning tree, and obtain the remaining tree branch set of the spanning tree;

Here, an improved BFS (Breadth First Search) method can be used to create a spanning tree and obtain the corresponding branch and cotree branch sets.

Step 403, traverse the I-tree branch set;

Step 404, searching for the shortest path;

From the end node of the branch of the current co-tree branch, the DFS (depth-first search) method can be used to search for the starting node, and the minimum closed loop of the current co-tree branch can be delineated.

Step 405, according to the conflicting residual tree branching rule, determine whether the mesh is repeated; if yes, then go to step 406; if so, go to step 407;

Step 406, circle the minimum closed loop, and then return to step 403;

Here, for the specific encircling process, you can refer to the aforementioned determination that the closed loop to be encircled has only one co-tree branch or there are multiple co-tree branches and only the current co-tree branch is not a closed loop, then the circle is currently closed loop and mark the current co-tree branch; or determine that there are multiple co-tree branches in the closed loop to be delineated and at least one co-tree branch delineated closed loop duplicates the current closed loop, then the current co-tree branch is added to the conflict The branch set of the residual tree will not be repeated here.

Step 407, obtaining the conflicting residual tree branch set;

Step 408, adding the co-tree branches that have delineated the closed loop to the spanning tree to generate a network graph;

Step 409, traverse the conflict residual tree branch set;

Step 410, searching for the shortest path respectively;

Add the conflicting co-tree branches to the graph G (that is, the network graph) one by one, disconnect each co-tree branch respectively, start from the end node of the branch, and use the DFS method to search for the closed loop corresponding to the co-tree branch at the start node. Take the one with the shortest closed loop path length and add it to the spanning tree first as the current minimum closed loop;

Add the conflicting co-tree branch after obtaining the minimum closed loop to the network graph, continue to draw a closed loop based on the DFS method for the remaining co-tree branches, and add the closed loop with the shortest path length to the spanning tree, enriching the The current minimum closed loop is to continuously accumulate the current minimum closed loop.

Step 411, obtaining the minimum closed loop;

Step 412, determine whether it is a minimum independent closed loop,

In practical applications, repeat the aforementioned steps 409 to 411 until all the co-tree branches are added to the network graph, that is, a set of minimum closed loops is obtained, and the independence check is performed on the set of minimum closed loops to ensure that the obtained minimum independent closed loop is obtained. loop; if the minimum independent closed loop does not satisfy the independence requirement, go back to step 408 .

In an application example, based on the iVent three-dimensional ventilation software platform, the VC++ development tool can be used for secondary development, and an improved loop air volume calculation method based on the minimum independent closed loop can be realized. Mine ventilation network model for network solution. The operating environment is Windows7, the CPU is Intel(R) Core(TM) i5-34703.2GHz, and the memory is 4GB. The results of the network solution are shown in Table 1.

Table 1

It can be seen from the convergence diagrams of the four mine ventilation networks that the improved loop air volume method based on the minimum independent closed loop has better convergence effect, and it can also quickly converge in the calculation of multi-fan and multi-stage stations, which can adapt to large The requirements for rapid solution of the complex-scale mine ventilation network.

From the perspective of the complexity of the mine ventilation network, the four mine ventilation networks are becoming more and more complex, with the number of independent loops being 58, 152, 179 and 238 respectively. However, the number of iterations of the improved closed-loop solution algorithm has not increased significantly. 19, 51, 67 and 78, which basically increase linearly with the network complexity. Therefore, it can be basically considered that the improved loop air volume method based on the minimum independent closed loop has better convergence and stability.

In order to realize the method of the embodiment of the present invention, the embodiment of the present invention also provides a multi-fan and multi-stage machine station ventilation network calculation device, which is set in the multi-fan and multi-stage machine station ventilation network calculation equipment, as shown in FIG. 6 , the The multi-fan and multi-stage ventilation network solution device includes: a first building module 601 , a second building module 602 , a third building module 603 , a search module 604 and a solution module 605 . in,

The first building module 601 is used to create a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtain the remaining tree branch set of the spanning tree;

The second construction module 602 is configured to delineate a closed loop based on each co-tree branch in the co-tree branch set, and construct a conflicting co-tree branch set;

The third building module 603 is configured to add the co-tree branches that have been delineated and closed loops to the spanning tree to generate a network graph;

The search module 604 is configured to traverse each conflicting residual tree branch in the conflicting residual tree branch set, update the network graph, and obtain a minimum independent closed loop;

The solution module 605 is configured to perform an iterative operation on the minimum independent closed loop to obtain a solution result of the ventilation network.

In some embodiments, the second building block 602 is specifically used to:

Traverse each co-tree branch in the co-tree branch set, and delineate each co-tree branch in a closed loop;

If it is determined that the closed loop to be delineated has only one co-tree branch or there are multiple co-tree branches and only the current co-tree branch is not delineated as a closed loop, then the current closed loop is delineated and the current co-tree branch is marked;

If it is determined that there are multiple co-tree branches in the closed loop to be delineated, and at least one co-tree branch delineates the closed loop duplicates with the current closed loop, the current co-tree branch is added to the conflicting co-tree branch set.

In some embodiments, the search module 604 is specifically used to:

For each conflicting co-tree branch in the set of conflicting co-tree branches, adding the conflicting co-tree branch to the network graph;

For each network graph after adding the conflicting residual tree branch, the network graph is repeatedly updated until each of the conflicting residual tree branches is added to the network graph;

The minimum independent closed loop is generated based on the updated network graph.

In some embodiments, the search module 604 repeatedly updates the network graph for each network graph after adding the conflicting residual tree branch, including:

For the network graph after adding the conflicting redundant tree branches, each redundant tree branch is disconnected respectively, and the closed loop of each disconnected redundant tree branch is delineated based on the depth-first search DFS method, and the closed loop with the shortest path length is added to all the closed loops. on the spanning tree, as the current minimum closed loop;

Add the conflicting co-tree branch after obtaining the minimum closed loop to the network graph, continue to draw a closed loop based on the DFS method for the remaining co-tree branches, and add the closed loop with the shortest path length to the spanning tree, enriching the the current minimum closed loop.

In some embodiments, the search module 604 generates the minimum independent closed loop based on the updated network graph, including:

It is judged whether the minimum closed loops of the updated network graph are independent, and if so, the minimum independent closed loop is obtained; Co-tree branches, update the network graph, and obtain the minimum independent closed loop.

In practical application, the first building module 601, the second building module 602, the third building module 603, the search module 604 and the calculation module 605 can be implemented by the processor in the multi-fan and multi-stage station ventilation network calculation device. . Of course, the processor needs to run a computer program in memory to perform its functions.

It should be noted that: when the multi-fan and multi-level machine station ventilation network calculation device provided in the above embodiment is used to calculate the multi-fan and multi-stage machine station ventilation network, only the division of the above program modules is used for illustration. , the above-mentioned processing can be allocated by different program modules as required, that is, the internal structure of the device is divided into different program modules, so as to complete all or part of the above-described processing. In addition, the multi-fan and multi-stage machine station ventilation network calculation device provided in the above embodiment belongs to the same concept as the multi-fan and multi-stage machine station ventilation network calculation method embodiment, and the specific implementation process is detailed in the method embodiment, which will not be repeated here. .

Based on the hardware implementation of the above program modules, and in order to implement the method of the embodiment of the present invention, the embodiment of the present invention further provides a multi-fan and multi-stage machine station ventilation network calculation device. FIG. 7 only shows an exemplary structure of the device but not the whole structure, and some or all of the structures shown in FIG. 7 may be implemented as required.

As shown in FIG. 7 , a device 700 provided by an embodiment of the present invention includes: at least one processor 701 , a memory 702 , a user interface 703 , and at least one network interface 707 . The various components in the multi-fan and multi-stage station ventilation network calculation device 700 are coupled together through a bus system 705 . It will be understood that the bus system 705 is used to implement the connection communication between these components. In addition to the data bus, the bus system 705 also includes a power bus, a control bus and a status signal bus. However, for clarity of illustration, the various buses are labeled as bus system 705 in FIG. 7 .

The user interface 703 may include a display, a keyboard, a mouse, a trackball, a click wheel, keys, buttons, a touch pad or a touch screen, and the like.

The memory 702 in the embodiment of the present invention is used to store various types of data to support the operation of the multi-fan and multi-stage ventilation network calculation device. Examples of such data include: any computer program used to operate on a multi-fan multi-stage station ventilation network solver.

The method for calculating the ventilation network of the multi-fan and multi-stage station disclosed in the embodiment of the present invention may be applied to the processor 701 or implemented by the processor 701 . The processor 701 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the method for calculating the ventilation network of the multi-fan and multi-stage station may be completed by the hardware integrated logic circuit in the processor 701 or the instructions in the form of software. The above-mentioned processor 701 may be a general-purpose processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. The processor 701 may implement or execute the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, and the storage medium is located in the memory 702. The processor 701 reads the information in the memory 702 and completes the steps of the multi-fan and multi-level station ventilation network calculation method provided by the embodiment of the present invention in combination with its hardware.

In an exemplary embodiment, the multi-fan and multi-stage ventilation network calculation device may be implemented by one or more Application Specific Integrated Circuits (ASIC, Application Specific Integrated Circuits), DSPs, and Programmable Logic Devices (PLDs, Programmable Logic Devices). , Complex Programmable Logic Device (CPLD, Complex Programmable Logic Device), FPGA, general-purpose processor, controller, microcontroller (MCU, Micro Controller Unit), microprocessor (Microprocessor), or other electronic components are implemented for executing the aforementioned method.

It will be appreciated that memory 702 may be either volatile memory or non-volatile memory, and may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM, Read Only Memory), a programmable read-only memory (PROM, Programmable Read-Only Memory), an erasable programmable read-only memory (EPROM, Erasable Programmable Read-only memory) Only Memory), Electrically Erasable Programmable Read-Only Memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), Magnetic Random Access Memory (FRAM, ferromagnetic random access memory), Flash Memory (Flash Memory), Magnetic Surface Memory , CD-ROM, or Compact Disc Read-Only Memory (CD-ROM, Compact Disc Read-Only Memory); the magnetic surface memory can be a magnetic disk memory or a tape memory. The volatile memory may be Random Access Memory (RAM), which is used as an external cache memory. By way of example and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory Memory (DRAM, Dynamic Random Access Memory), Synchronous Dynamic Random Access Memory (SDRAM, SynchronousDynamic Random Access Memory), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM, Double Data Rate Synchronous Dynamic Random Access Memory), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), Synchronous Link Dynamic Random Access Memory (SLDRAM, SyncLink Dynamic Random Access Memory), Direct Memory Bus Random Access Memory (DRRAM, Direct Rambus Random Access Memory). The memory described in the embodiments of the present invention is intended to include, but not be limited to, these and any other suitable types of memory.

In an exemplary embodiment, the embodiment of the present invention further provides a storage medium, that is, a computer storage medium, which may be a computer-readable storage medium, for example, including a memory 702 for storing a computer program. The processor 701 of the station ventilation network calculation device executes the steps described in the method of the embodiment of the present invention. The computer-readable storage medium may be memory such as ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disk, or CD-ROM.

It should be noted that "first", "second", etc. are used to distinguish similar objects, and are not necessarily used to describe a specific sequence or sequence.

In addition, the technical solutions described in the embodiments of the present invention may be combined arbitrarily if there is no conflict.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention. should be included within the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims (7)

1. a multi-fan multi-stage machine station ventilation network solution method, is characterized in that, comprises: Create a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtain a set of remaining tree branches of the spanning tree; Based on each co-tree branch in the co-tree branch set, a closed loop is drawn, and a conflicting co-tree branch set is constructed; Add the co-tree branches that have been delineated closed loops to the spanning tree to generate a network graph; Traverse each conflicting residual tree branch in the conflicting residual tree branch set, update the network graph, and obtain a minimum independent closed loop; Performing an iterative operation on the minimum independent closed loop to obtain a solution result of the ventilation network; Described based on each co-tree branch in the co-tree branch set, circle and draw a closed loop, and construct a conflicting co-tree branch set, including: Traverse each co-tree branch in the co-tree branch set, and delineate each co-tree branch in a closed loop; If it is determined that the closed loop to be delineated has only one co-tree branch or there are multiple co-tree branches and only the current co-tree branch is not delineated as a closed loop, then the current closed loop is delineated and the current co-tree branch is marked; If it is determined that there are multiple co-tree branches in the closed loop to be delineated, and at least one co-tree branch delineates the closed loop duplicates with the current closed loop, the current co-tree branch is added to the conflicting co-tree branch set. 2. The method according to claim 1, wherein the traversing each conflicting co-tree branch in the set of conflicting co-tree branches, updating the network graph, and obtaining a minimum independent closed loop, comprising: For each conflicting co-tree branch in the set of conflicting co-tree branches, adding the conflicting co-tree branch to the network graph; For each network graph after adding the conflicting residual tree branch, the network graph is repeatedly updated until each of the conflicting residual tree branches is added to the network graph; The minimum independent closed loop is generated based on the updated network graph. 3. The method according to claim 2, wherein, repeatedly updating the network graph for each of the network graphs after adding the conflicting residual tree branches, comprising: For the network graph after adding the conflicting redundant tree branches, each redundant tree branch is disconnected respectively, and the closed loop of each disconnected redundant tree branch is delineated based on the depth-first search DFS method, and the closed loop with the shortest path length is added to all the closed loops. on the spanning tree, as the current minimum closed loop; Add the conflicting co-tree branch after obtaining the minimum closed loop to the network graph, continue to draw a closed loop based on the DFS method for the remaining co-tree branches, and add the closed loop with the shortest path length to the spanning tree, enriching the the current minimum closed loop. 4. The method according to claim 2, wherein the generating the minimum independent closed loop based on the updated network graph comprises: Judging whether the updated minimum closed loops in the network graph are independent, and if so, obtain the minimum independent closed loop; Co-tree branches, update the network graph, and obtain the minimum independent closed loop. 5. A multi-fan multi-stage machine station ventilation network solving device is characterized in that, comprising: The first building module is used to create a spanning tree for the ventilation network of the multi-fan and multi-stage machine station, and obtain the remaining tree branch set of the spanning tree; The second building module is used for delineating a closed loop based on each co-tree branch in the co-tree branch set, and constructing a conflicting co-tree branch set; The third building module is used to add the co-tree branches that have been delineated and closed loops to the spanning tree to generate a network graph; a search module, configured to traverse each conflicting redundant tree branch in the conflicting redundant tree branch set, update the network graph, and obtain a minimum independent closed loop; a solution module, configured to perform an iterative operation on the minimum independent closed loop to obtain a solution result of the ventilation network; The second building block is specifically used for: Traverse each co-tree branch in the co-tree branch set, and delineate each co-tree branch in a closed loop; If it is determined that the closed loop to be delineated has only one co-tree branch or there are multiple co-tree branches and only the current co-tree branch is not delineated as a closed loop, then the current closed loop is delineated and the current co-tree branch is marked; If it is determined that there are multiple co-tree branches in the closed loop to be delineated, and at least one co-tree branch delineates the closed loop duplicates with the current closed loop, the current co-tree branch is added to the conflicting co-tree branch set. 6. A multi-fan multi-stage machine station ventilation network solving device, characterized in that, comprising: a processor and a memory for storing a computer program that can be run on the processor, wherein, The processor is configured to execute the steps of the method according to any one of claims 1 to 4 when running the computer program. 7 . A storage medium, wherein a computer program is stored on the storage medium, wherein when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are implemented. 8 .

Images