Evolution of Resource Allocation Networks

DSpace/Manakin Repository

Evolution of Resource Allocation Networks

Show full item record

Title: Evolution of Resource Allocation Networks
Author: DAS, AK; SHENOY, UV; BANDYOPADHYAY, S
Abstract: 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.
URI: http://dx.doi.org/10.1021/ie9003392
http://dspace.library.iitb.ac.in/xmlui/handle/10054/3835
http://hdl.handle.net/10054/3835
Date: 2009


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account