Process network design and optimisation using P-graph: The success, the challenges and potential roadmap

Petar S. Varbanov, F. Friedler, Jiří J. Klemeš

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1549-1554
Number of pages6
JournalChemical Engineering Transactions
Volume61
DOIs
Publication statusPublished - Jan 1 2017

Fingerprint

Planning
Supply chains
User interfaces
Sensitivity analysis
Industry

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Process network design and optimisation using P-graph : The success, the challenges and potential roadmap. / Varbanov, Petar S.; Friedler, F.; Klemeš, Jiří J.

In: Chemical Engineering Transactions, Vol. 61, 01.01.2017, p. 1549-1554.

Research output: Contribution to journalArticle

@article{09c8ce97a511456c84f18e568db074c6,
title = "Process network design and optimisation using P-graph: The success, the challenges and potential roadmap",
abstract = "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.",
author = "Varbanov, {Petar S.} and F. Friedler and Klemeš, {Jiř{\'i} J.}",
year = "2017",
month = "1",
day = "1",
doi = "10.3303/CET1761256",
language = "English",
volume = "61",
pages = "1549--1554",
journal = "Chemical Engineering Transactions",
issn = "1974-9791",
publisher = "AIDIC-Italian Association of Chemical Engineering",

}

TY - JOUR

T1 - Process network design and optimisation using P-graph

T2 - The success, the challenges and potential roadmap

AU - Varbanov, Petar S.

AU - Friedler, F.

AU - Klemeš, Jiří J.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85030777118&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030777118&partnerID=8YFLogxK

U2 - 10.3303/CET1761256

DO - 10.3303/CET1761256

M3 - Article

AN - SCOPUS:85030777118

VL - 61

SP - 1549

EP - 1554

JO - Chemical Engineering Transactions

JF - Chemical Engineering Transactions

SN - 1974-9791

ER -