Non-linear Programming via P-graph Framework

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F19%3APU134374" target="_blank" >RIV/00216305:26210/19:PU134374 - isvavai.cz</a>

Result on the web

<a href="https://www.aidic.it/cet/19/76/084.pdf" target="_blank" >https://www.aidic.it/cet/19/76/084.pdf</a>

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Non-linear Programming via P-graph Framework

Original language description

P-graph is a graph-theoretic method which is designed to solve process network synthesis (PNS) problem using combinatorial and optimisation algorithms. Due to its visual interface for data encoding and results display; and its capability of generating multiple solutions (optimal and sub-optimal) simultaneously, the utility of P-graph has expanded into a broad range of studies recently.However, this powerful graph-theoretic method still falls short of dealing with non-linear problems. The problem can be found from the cost estimation provided by P-graph software. Despite it allows users to input the sizing cost (noted as “proportional cost” in P-graph software), the capacity and the cost are assumed to be linearly correlated. This inaccurate and unreliable cost estimation has increased the difficulty of making optimal decisions and therefore lead to undesirable profit loss. This paper proposes to solve the fundamental linearity problem by implementing trained artificial neural networks (ANN) into P-graph. To achieve this, an ANN model which utilised thresholded rectified linear unit (ReLU) activation function is developed in a segregated computational tool. The identified neurons are then modelled in P-graph in order to convert the input into the nonlinear output. To demonstrate the effectiveness of the proposed method, an illustrative case study of biomass transportation is used. With the use of the trained neurons, the non-linear estimation of transportation cost which considered fuel consumption cost, vehicle maintenance cost and labour cost are successfully modelled in P-graph. This work is expected to pave ways for P-graph users to expand the utility of P-graph in solving other more complex non-linear problems.

Czech name

—

Czech description

—

Type

J_SC - Article in a specialist periodical, which is included in the SCOPUS database

CEP classification

—

OECD FORD branch

20402 - Chemical process engineering

Project

<a href="/en/project/EF16_026%2F0008413" target="_blank" >EF16_026/0008413: Strategic Partnership for Environmental Technologies and Energy Production</a><br>

Continuities

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

Publication year

2019

Confidentiality

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

Name of the periodical

Chemical Engineering Transactions

ISSN

2283-9216

e-ISSN

—

Volume of the periodical

76

Issue of the periodical within the volume

1

Country of publishing house

IT - ITALY

Number of pages

6

Pages from-to

499-504

UT code for WoS article

—

EID of the result in the Scopus database

2-s2.0-85076266101