Calculating maximum entropy flows in multi-source, multi-demand networks

Calculating maximum entropy flows in multi-source, multi-demand networks

0.00 Avg rating0 Votes
Article ID: iaor20002904
Country: Netherlands
Volume: 31
Issue: 6
Start Page Number: 695
End Page Number: 729
Publication Date: Aug 1999
Journal: Engineering Optimization
Authors: , ,
Keywords: quality & reliability, optimization, networks
Abstract:

Previous work has shown how maximum entropy flows in a water distribution network can be calculated by maximizing a nodal entropy function. This requires the use of numerical nonlinear optimization. In the case of single-source networks a much simpler path entropy formulation exists which permits solutions to be obtained quickly by manual calculations not requiring numerical optimization. This paper extends the path entropy formulation to general multi-source, multi-demand networks and develops a simple manual calculation method for maximum entropy flows in these general networks. The method is quick, non-iterative and does not directly involve the use of numerical optimization. Examples are presented and discussed.

Reviews

Required fields are marked *. Your email address will not be published.