Premium
Segregated targeting for multiple resource networks using decomposition algorithm
Author(s) -
Bandyopadhyay Santanu,
Sahu Gopal Chandra,
Foo Dominic Chwan Yee,
Tan Raymond R.
Publication year - 2010
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.12050
Subject(s) - pinch analysis , decomposition , resource (disambiguation) , process integration , set (abstract data type) , mathematical optimization , decomposition method (queueing theory) , modular design , computer science , process (computing) , algorithm , engineering , mathematics , process engineering , chemistry , computer network , organic chemistry , discrete mathematics , programming language , operating system
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 be 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. © 2009 American Institute of Chemical Engineers AIChE J, 2010