MULTIPARAMETRIC OPTIMIZATION OF MINE VENTILATION NETWORKS

This paper presents a method of specified optimization of mine ventilation networks based on multi-agent search methods, which include the possibility of varying the different types of parameters of the mine workings, such as aerodynamic resistance, pressure of the main fan and local subsurface fans, as well as their location in the mine. The basic mathematical ideas of the proposed approach are presented. The optimization results for a typical fragment of mine ventilation network are presented.

Keywords

Mine ventilation networks, multi-agent methods, optimization, optimization algorithms, aerodynamic resistance, mine fans, target function.

Issue number: 3
Year: 2017
ISBN:
UDK: 622.451. 001.24
DOI:
Authors: Tantsov P.N.

About authors: Tantsov P. N., Candidate of Technical Sciences, Assistant Professor, National University of Science and Technology «MISiS», 119049, Moscow, Russia, e-mail: ptantsov@gmail.com.

REFERENCES:
1. Shkundin S. Z., Petrov A. G., Vanovskiy V. V., Tantsov P. N. Dinamicheskiy raschetshakhtnykh ventilyatsionnykh setey (Dynamic analysis of mine ventilation networks), Moscow, MGGU, 2013, 8 p.: Deposited in Publishing house «Mining Book» 11.06.13 № 978/09-13.
2. Shkundin S. Z., Ivannikov A. L., Zinchenko I. N. Ugol’. 2009, no 1, pp. 35–37.
3. Cross H. Analysis of flow in networks of conduits or conductors. Urbana, Illinois: Eng.Exp. Station of Univ. of Illinois, 1936, November, Bull, no 286. 29 p.
4. Abramov F. A., Tyan R. B., Potemkin V. Ya. Raschet ventilyatsionnykh setey shakht i rudnikov (Design of mine ventilation networks), Moscow, Nedra, 1978, 232 p.
5. Karpenko A. P. Informatsionnye tekhnologii. 2012, no 7, pp. 1–32
6. Karpenko A. P. Sovremennye algoritmy poiskovoy optimizatsii. Algoritmy, vdokhnovlennye prirodoy (Modern search optimization algorithms, Nature-inspired algorithms), Moscow, Izd-vo MGTU im. N.E. Baumana, 2014, 446 p.
7. Dorigo M., Gambardella L. M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation. 1997. Vol. 1, 1. Р. 53–66.

Подписка на рассылку

Подпишитесь на рассылку, чтобы получать важную информацию для авторов и рецензентов.