Evolution of Resource Allocation Networks
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
Evolution of Resource Allocation Networks
|
|
Creator |
DAS, AK
SHENOY, UV BANDYOPADHYAY, S |
|
Subject |
mass-exchange networks
rectifying-stripping curves water-heating systems design-space approach pinch analysis property integration componentless design distillation column material reuse supply chains |
|
Description |
It is often desirable to evolve a resource allocation network (RAN) into a simpler one for improved controllability, operability, and ease of implementation. In this paper, a methodology, based on the concept of graph theory and process integration, is proposed to evolve a preliminary RAN into a simpler one involving fewer interconnections (matches) by incurring the minimum resource penalty. The proposed methodology is essentially based on four evolution strategies: loop breaking without. violation, two-loop relaxation, loop breaking with path relaxation, and direct path elimination. The procedure is applied to various RANs such as water allocation, hydrogen allocation, and material allocation in a reuse network. The evolved networks are compared With results obtained from a new mathematical optimization formulation involving mixed integer linear programming.
|
|
Publisher |
AMER CHEMICAL SOC
|
|
Date |
2011-07-14T02:28:02Z
2011-12-26T12:47:31Z 2011-12-27T05:35:35Z 2011-07-14T02:28:02Z 2011-12-26T12:47:31Z 2011-12-27T05:35:35Z 2009 |
|
Type |
Article
|
|
Identifier |
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 48(15), 7152-7167
0888-5885 http://dx.doi.org/10.1021/ie9003392 http://dspace.library.iitb.ac.in/xmlui/handle/10054/3835 http://hdl.handle.net/10054/3835 |
|
Language |
en
|
|