Abstract

The feature graph (Q-H graph) is the best way to intuitively and quantitatively reflect all features of the ventilation network. In this paper, an optimized adaptive genetic algorithm is proposed to solve the problem that rectangular blocks are cut in the process of drawing a Q-H diagram of a three-dimensional ventilation network. The algorithm adopts binary coding based on node sorting and mixed genetic coding based on integer coding. The formulas for calculating the adaptive crossover rate and mutation rate are designed, which can effectively generate new individuals and get rid of the search for local optimal values, ensuring the global optimal solution. Matlab was used to test the optimization effect of the Q-H graph; the results show that, for a complex ventilation network, the improved adaptive genetic algorithm can make the Q-H graph significantly reduce the number of rectangular pieces, which is divided, and make the Q-H graph have better effect to draw clearly and intuitively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call