Underground Mining - Computer-Aided Solution of Complex Ventillation Networks

The development of computer programs to solve complex ventilation networks has reached a point of refinement where these programs become a necessary tool of the ventilating engineer. Such a program is presented. This program has an increased efficiency over its predecessors; it also includes the important facility of fixed quantity branches. This is in addition to the earlier capabilities of free-splitting, internal or external fans, and natural ventilation pressures. The program is written in Fortran IV with double-precision arithmetic and is listed here. Sample problems with input and output are also given. The recent, and presumably continuing, official interest in mine safety is bound to result in more stringent control requirements for ventilation. Anticipating this requirement, the Dept. of Mining, The Pennsylvania State University, has developed a computer program for the solution of complex mine ventilation networks. It is the opinion of this department that the program has sufficient merit to warrant its use in normal industrial operating conditions. Although the undergraduate mining engineering students of this department are routinely trained to use the program, it was felt that this training did not present a fast enough means of dissemination; consequently, this paper was written. The conception of the program is not new;1; however, the present version incorporates features that changes it from a scientific endeavor to a useful operating tool. These features include those of earlier programs, such as free-splitting, external or internal fans, and natural ventilation processes plus the important ability of handling fixed quantity branches, and of increased efficiency giving reduced cost. The facility for fixed quantities will be discussed in more detail. The solution of any network depends upon satisfying Kirchchoff's laws. These state that the sum of flow at any junction is zero, and that the sum of the pressure drop in branches totals the pressure drop in the mesh constituted by those branches, that is that the pressure drop around any mesh is zero. The terminology is derived from Synge," and is, in fact, that used by Topologists. A branch is any airway of uniform characteristics; a junction is where two or more airways meet (the minimum number of two airways is useful for describing the point where a low resistance airway changes into a high resistance one due to some physical constriction); a mesh is a path, along some branches, that returns on to itself, but does not need to traverse the same branch twice in order to do so; and a tree describes all those branches in a network which, while connected through all the junctions, do not form any meshes. Obviously the branches-in-tree are open-ended and can be shown to be one less than the number of junction (J-1). The branches-out-of-tree, also called basic branches, are equal to the number of basic meshes and are M = N — J + 1, where M is the number of meshes and N is the number of branches. The major difference between this network and an electrical one is that the law attributed to Atkinson for pressure drop is utilized rather than Ohm's law. Atkinson stated that the pressure drop (potential) is equal to a resistance factor multiplied by the quantity squared. This is written H = RlQlQ where H is the head loss. Q? is written in this factored fashion so that H will always have the same sign as Q. A negative sign is used to indicate that flow in a branch is opposite to that of its containing mesh. A mesh takes the direction of its basic branch. Utilizing Atkinson's law in Kirchchoff's second law and bearing in mind that the first law must remain satisfied, the program will determine all quantities, or head losses as they are related, for the branches of the network. The program uses a Geuss-Seidel form of in-teration, starting from an arbitrary Q and using a correction factor of the type first suggested by Professor Hardy Cross' that will handle the nonlinear equation of Atkinson's law. A fuller description of the interative process is included in Wang and Hartman.' Iteration continues until the correction factor is less than or equal to a preset error (E) or until a maximum number of iterations (MAXIT) have been reached. Utilizing an E of 50 cfm, sample problems have had rapid solutions. Rapidity of solution is also ensured by the method of selecting meshes and basic branches. This is done by the computer, which chooses the highest resistance branches, fixed quantity branches, and those containing fans, as basic branches. Natural ventilation pressures are handled as fans of constant pressure and may be assigned to any branch. The computer will generate a fan characteristic by polynominal fitting if a few operating points from the desired fan are input. A fan may be placed in any branch of the network, except those with fixed quantities. The strength of the present program over its earlier versions is its ability to handle fixed quantity branches. This means that certain branches can have their quantity determined, or preset, by the ventilating engineer. Operating under this constraint, the program will analyze the network and output the pressure change necessary to achieve this desired quantity. A call for positive head loss would require an auxiliary fan; negative head loss would require a regulator. This represents a powerful tool for the ventilating engineer who must insure that certain quantities of air pass across the operating faces or through working stopes. McPherson6 suggested that a ventilation program would be useful for determining in advance which branches were receiving inadequate air, and that subsequent calculations would then indicate the necessary corrections. The present program makes these corrections. Thus the mine manager can know immediately the consequences of changes to his system;