Reduction of complex energy-integrated process networks using graph theory. (4th August 2015)

• Record Type: Journal Article
• Authors: Jogwar, Sujit S.; Rangarajan, Srinivas; Daoutidis, Prodromos
• Is Part Of: Computers & chemical engineering. Volume 79(2015)
• Page Start: 46
• Page End: 58
• Publication Date: 2015-08-04
• Subjects: Graph theory -- Hierarchical control -- Integrated plant control; Chemical engineering -- Data processing -- Periodicals; 660.0285
• DOI: 10.1016/j.compchemeng.2015.04.025
• Languages: English
• ISSNs: 0098-1354

Abstract

Abstract : Highlights: A graph theory-based algorithm is presented for the reduction of complex energy-integrated networks. The algorithm automates the successive singular perturbations-based method. The algorithm is fast, efficient and scalable to large networks. An application to a naphtha reforming process is discussed. Abstract: This paper focuses on the analysis of complex (multi-loop) energy-integrated process networks. Simple (single-loop) energy-integrated networks (comprising of large energy recycle or throughput) with two-time scale dynamics are the building blocks for such complex networks. The modular structure of these complex networks lends them to a graph theoretic analysis, whereby weak and strong connections between process units arising from time scale separation are identified from structural information. Subsequently, a graph-theoretic framework for network analysis and control is developed, and connecting links are built to an equivalent analysis using singular perturbations. The proposed analysis framework is illustrated via application to a representative complex process network.