With a water-supply network by dynamic programming. The minimal as an example, the network was optimized annual discounted costs were taken as an objective function and node pressure etc. as constraint conditions. The...With a water-supply network by dynamic programming. The minimal as an example, the network was optimized annual discounted costs were taken as an objective function and node pressure etc. as constraint conditions. The alternative pipe diameters were optimized as per enumeration method and the group allowing objective function with the least values would be the optimized one. It is proved the optimized pipe network reduced by 11.49% in terms of cost and the optimized ben- efits proved much significant.展开更多
文摘With a water-supply network by dynamic programming. The minimal as an example, the network was optimized annual discounted costs were taken as an objective function and node pressure etc. as constraint conditions. The alternative pipe diameters were optimized as per enumeration method and the group allowing objective function with the least values would be the optimized one. It is proved the optimized pipe network reduced by 11.49% in terms of cost and the optimized ben- efits proved much significant.
