Evolution of resource allocation networks / Ashish K. Das in Industrial & engineering chemistry research, Vol. 48 N° 15 (Août 2009)  

Public ISBD [article]  inIndustrial & engineering chemistry research > Vol. 48 N° 15 (Août 2009) . - pp. 7152–7167 Titre : Evolution of resource allocation networks Type de document : texte imprimé Auteurs : Ashish K. Das, Auteur ; Uday V. Shenoy, Auteur ; Santanu Bandyopadhyay, Auteur Année de publication : 2009 Article en page(s) : pp. 7152–7167 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Resource allocation network Graph theoryProcess integration Résumé : 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. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie9003392 [article] Evolution of resource allocation networks [texte imprimé] / Ashish K. Das, Auteur ; Uday V. Shenoy, Auteur ; Santanu Bandyopadhyay, Auteur . - 2009 . - pp. 7152–7167. Chemical engineering Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 48 N° 15 (Août 2009) . - pp. 7152–7167 Mots-clés : Resource allocation network Graph theoryProcess integration Résumé : 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. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie9003392

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire