SEQUENTIAL CELL FLOWGRAPH REPRESENTATION FOR THE COOLING TOWER PROBLEM

Abstract

A new approach, called sequential cell How graph representation, to the packed tower process problem is studied, taking aim at freedom from the troublesome graphical routine. An algorithm for the construction of such flowgraphs is proposed and applied to a cooling tower process problem.
The resulted sequential cell flowgraph shows that the problem treated is a single-variable searching problem with three tearing variables. Computer programming according to this representation will permit rapid solution for the tower height and the behavior of state variables through the tower.