Fixed airflow distribution of ventilation network with maximum flow algorithm
Lijun Deng, Jian Liu
Available Online May 2014.
- https://doi.org/10.2991/lemcs-14.2014.210How to use a DOI?
- ventilation network; fixed airflow; independent circuit; max flow; the upper and lower capacities
- Whether there is a feasible flow of ventilation network that meets the demand of fixed airflow and the balance of airflow, when the number, quantities of fixed branches are all uncertain. It is called fixed airflow distribution problem, which was transformed into flow distribution problem. All branches have the upper and lower capacities bounds. The upper and lower capacities of fixed airflow branches were set to their values, while the upper capacities of other branches were set to infinity, and lower capacities were set to zero. Two virtual sources-sink nodes was added to the network, while the fixed branches were splitted into two new branches connected with the virutal source-sink nodes. The classical max flow algorithm was adopted to solve the new network. There was a solution of fixed airflow distribution when the new network had a feasible flow and each splitted branches reached its capacity. At last, the method was analysed by means of two examples.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Lijun Deng AU - Jian Liu PY - 2014/05 DA - 2014/05 TI - Fixed airflow distribution of ventilation network with maximum flow algorithm BT - International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2014) PB - Atlantis Press SN - 1951-6851 UR - https://doi.org/10.2991/lemcs-14.2014.210 DO - https://doi.org/10.2991/lemcs-14.2014.210 ID - Deng2014/05 ER -