All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F18%3APU130061" target="_blank" >RIV/00216305:26210/18:PU130061 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.3303/CET1870016" target="_blank" >http://dx.doi.org/10.3303/CET1870016</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3303/CET1870016" target="_blank" >10.3303/CET1870016</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language 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

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database

  • CEP classification

  • OECD FORD branch

    20402 - Chemical process engineering

Result continuities

  • Project

    <a href="/en/project/EF15_003%2F0000456" target="_blank" >EF15_003/0000456: Sustainable Process Integration Laboratory (SPIL)</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Chemical Engineering Transactions

  • ISSN

    2283-9216

  • e-ISSN

  • Volume of the periodical

    neuveden

  • Issue of the periodical within the volume

    70

  • Country of publishing house

    IT - ITALY

  • Number of pages

    6

  • Pages from-to

    91-96

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85051317524