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”

Process Network Design and Optimisation Using P-graph: The Success, the Challenges and Potential Roadmap

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F17%3APU127113" target="_blank" >RIV/00216305:26210/17:PU127113 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Process Network Design and Optimisation Using P-graph: The Success, the Challenges and Potential Roadmap

  • Original language description

    The P-graph framework is a combinatorial approach to synthesising and optimising process networks. It is very efficient in handling problems with high combinatorial complexity and has shown great superiority in reducing the related computational burden. Over the years, it has proven its efficiency in solving topologically and combinatorically challenging problems. Many successful applications to scientific and real-life problems have been produced, demonstrating the benefit potential. The application areas range from the initial chemical process synthesis to identifying the mechanisms of chemical and biochemical reactions, supply chains optimisation, regional resource planning, crisis management, evacuation planning and business process modelling. There have been tools of several generations implementing the P-graph framework, with a simple user interface, but featuring serious data input requirement. The P-graph framework also allows sensitivity analysis and produces usually a set of recommended solutions as opposed to the usual single output from straight applications of MP. The current contribution makes a critical overview of the achievements from applying the P-graph framework and the main issues to be dealt with. Based on that, a set of recommendations is made on the necessary future development of the implementations regarding modelling capability, data and algorithmic interfaces, representation of the modelled networks, as well as complexity management.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

    2017

  • 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

  • Article name in the collection

    Chemical Engineering: General Chemical Engineering

  • ISBN

    978-88-95608-51-8

  • ISSN

    1974-9791

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1549-1554

  • Publisher name

    Neuveden

  • Place of publication

    Neuveden

  • Event location

    Tianjin

  • Event date

    Aug 21, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article