Segregated Targeting for Multiple Resource Networks Using Decomposition Algorithm

Santanu Bandyopadhyay

doi:10.1002/aic.12050

Return

Segregated Targeting for Multiple Resource Networks Using Decomposition Algorithm

2009-10-28

Santanu Bandyopadhyay *

Gopal Chandra Sahu

Dominic C.Y. Foo

Raymond R. Tan

DOI：10.1002/aic.12050

Original

Save

View PDF

Abstract

En 中文

A generalized decomposition technique is presented for determining optimal resource usage in segregated targeting problems with single quality index (e.g., concentration, temperature, etc.) through pinch analysis. The latter problems are concerned with determining minimal resource requirements of process networks characterized by the existence of multiple zones, each consisting of a set of demands and using a unique external resource. However, all the zones share a common set of internal sources. The decomposition algorithm allows the problem to he decomposed into a sequence of subproblems, each of which can in turn be solved using any established graphical or algebraic targeting methodology to determine the minimum requirement of respective resource. This article presents a rigorous mathematical proof of the decomposition algorithm, and then demonstrates its potential applications with case studies on carbon-constrained energy sector planning, interplant water integration, and emergy-based multisector fuel allocation. (C) 2009 American Institute of Chemical Engineers AIChE J, 56: 1235-1248, 2010

Keywords:

resource conservation

process integration

pinch analysis

targeting

multiple resources

decomposition algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.