Towards generalized process networks: Prospective new research frontiers for the p-graph framework

The P-graph framework was originally developed to address Process Network Synthesis (PNS) problems in the preliminary design of chemical plants. P-graph provides a mathematically rigorous and computationally efficient framework for solving PNS problems via the maximal structure generation (MSG), sol...

Full description

Saved in:
Bibliographic Details
Main Authors: Tan, Raymond Girard R., Aviso, Kathleen B., Klemeš, Jiří Jaromír, Lam, Hon Loong, Varbanov, Petar S., Friedler, Ferenc
Format: text
Published: Animo Repository 2018
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/faculty_research/261
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=1260&context=faculty_research
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
id oai:animorepository.dlsu.edu.ph:faculty_research-1260
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:faculty_research-12602022-08-15T09:45:21Z Towards generalized process networks: Prospective new research frontiers for the p-graph framework Tan, Raymond Girard R. Aviso, Kathleen B. Klemeš, Jiří Jaromír Lam, Hon Loong Varbanov, Petar S. Friedler, Ferenc The P-graph framework was originally developed to address Process Network Synthesis (PNS) problems in the preliminary design of chemical plants. P-graph provides a mathematically rigorous and computationally efficient framework for solving PNS problems via the maximal structure generation (MSG), solution structure generation (SSG) and accelerated branch-and-bound (ABB) algorithms. MSG ensures rigorous generation of the maximal structure, while the ad hoc generation of a superstructure as basis for a mathematical programming model can lead to significant modelling errors. In addition, SSG allows the generation of combinatorially feasible network structures that can be utilized for practical decision-making by designers. For very large problems, ABB can reduce the computational effort of reaching globally optimal solutions by multiple orders of magnitude compared to conventional branch-and-bound solvers for Mixed Integer Linear Programming (MILP) models. In addition to conventional PNS problems, P-graph has been applied to the optimization of separation processes, Heat Exchanger Networks (HENs), Combined Heat and Power (CHP) systems, chemical reaction pathways, polygeneration plants, biorefineries, and supply chains. Further non-conventional applications have also been reported, such as the optimisation of office processes, human resource networks, and economic structures at the level of cities or regions. In addition to synthesis and design problems, P-graph has also been applied to operational problems, such as determining the best abnormal operating conditions for process networks. These diverse applications suggest the potential for applying the P-graph framework as a problem-solving strategy for a broad class of generalized process networks, beyond the traditional PNS problems in chemical plant design. This paper surveys recent trends in the P-graph literature and uses bibliometric analysis to identify promising trends and discusses potential directions for novel applications for optimization of generalized process networks, particularly for applications that address critical sustainability issues. Copyright © 2018, AIDIC Servizi S.r.l. 2018-01-01T08:00:00Z text application/pdf https://animorepository.dlsu.edu.ph/faculty_research/261 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=1260&context=faculty_research Faculty Research Work Animo Repository Bipartite graphs Chemical Engineering
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
topic Bipartite graphs
Chemical Engineering
spellingShingle Bipartite graphs
Chemical Engineering
Tan, Raymond Girard R.
Aviso, Kathleen B.
Klemeš, Jiří Jaromír
Lam, Hon Loong
Varbanov, Petar S.
Friedler, Ferenc
Towards generalized process networks: Prospective new research frontiers for the p-graph framework
description The P-graph framework was originally developed to address Process Network Synthesis (PNS) problems in the preliminary design of chemical plants. P-graph provides a mathematically rigorous and computationally efficient framework for solving PNS problems via the maximal structure generation (MSG), solution structure generation (SSG) and accelerated branch-and-bound (ABB) algorithms. MSG ensures rigorous generation of the maximal structure, while the ad hoc generation of a superstructure as basis for a mathematical programming model can lead to significant modelling errors. In addition, SSG allows the generation of combinatorially feasible network structures that can be utilized for practical decision-making by designers. For very large problems, ABB can reduce the computational effort of reaching globally optimal solutions by multiple orders of magnitude compared to conventional branch-and-bound solvers for Mixed Integer Linear Programming (MILP) models. In addition to conventional PNS problems, P-graph has been applied to the optimization of separation processes, Heat Exchanger Networks (HENs), Combined Heat and Power (CHP) systems, chemical reaction pathways, polygeneration plants, biorefineries, and supply chains. Further non-conventional applications have also been reported, such as the optimisation of office processes, human resource networks, and economic structures at the level of cities or regions. In addition to synthesis and design problems, P-graph has also been applied to operational problems, such as determining the best abnormal operating conditions for process networks. These diverse applications suggest the potential for applying the P-graph framework as a problem-solving strategy for a broad class of generalized process networks, beyond the traditional PNS problems in chemical plant design. This paper surveys recent trends in the P-graph literature and uses bibliometric analysis to identify promising trends and discusses potential directions for novel applications for optimization of generalized process networks, particularly for applications that address critical sustainability issues. Copyright © 2018, AIDIC Servizi S.r.l.
format text
author Tan, Raymond Girard R.
Aviso, Kathleen B.
Klemeš, Jiří Jaromír
Lam, Hon Loong
Varbanov, Petar S.
Friedler, Ferenc
author_facet Tan, Raymond Girard R.
Aviso, Kathleen B.
Klemeš, Jiří Jaromír
Lam, Hon Loong
Varbanov, Petar S.
Friedler, Ferenc
author_sort Tan, Raymond Girard R.
title Towards generalized process networks: Prospective new research frontiers for the p-graph framework
title_short Towards generalized process networks: Prospective new research frontiers for the p-graph framework
title_full Towards generalized process networks: Prospective new research frontiers for the p-graph framework
title_fullStr Towards generalized process networks: Prospective new research frontiers for the p-graph framework
title_full_unstemmed Towards generalized process networks: Prospective new research frontiers for the p-graph framework
title_sort towards generalized process networks: prospective new research frontiers for the p-graph framework
publisher Animo Repository
publishDate 2018
url https://animorepository.dlsu.edu.ph/faculty_research/261
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=1260&context=faculty_research
_version_ 1743177722019971072