Publication detail

Towards Generalized Process Networks: Prospective New Research Frontiers for the P-graph Framework

Tan, R.R. Aviso, K.B. Klemeš, J.J. Lam, H.L. Varbanov, P.S. Friedler, F.

Original Title

Towards Generalized Process Networks: Prospective New Research Frontiers for the P-graph Framework

Type

journal article in Scopus

Language

English

Original Abstract

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.

Keywords

Chemical plants; Chemicals; Cogeneration plants; Decision making; Heat exchangers; Integer programming; Supply chains; Abnormal operating conditions; Bibliometric analysis; Combined heat and power system; Computationally efficient; Heat exchanger network; Mathematical programming models; Mixed integer linear programming model; Optimization of separation; Problem solving

Authors

Tan, R.R.; Aviso, K.B.; Klemeš, J.J.; Lam, H.L.; Varbanov, P.S.; Friedler, F.

Released

1. 8. 2018

Publisher

Italian Association of Chemical Engineering - AIDIC

ISBN

2283-9216

Periodical

Chemical Engineering Transactions

Number

70

State

Republic of Italy

Pages from

91

Pages to

96

Pages count

6

BibTex

@article{BUT151731,
  author="Tan, R.R. and Aviso, K.B. and Klemeš, J.J. and Lam, H.L. and Varbanov, P.S. and Friedler, F.",
  title="Towards Generalized Process Networks: Prospective New Research Frontiers for the P-graph Framework",
  journal="Chemical Engineering Transactions",
  year="2018",
  number="70",
  pages="91--96",
  doi="10.3303/CET1870016",
  issn="2283-9216"
}