88. Extension of P-graph Framework to Simultaneously Cover Directed and Nondirected Elements
Invited abstract in session WE-4: P-graph Algorithms, stream P-graph algorithms and applications.
Wednesday, 14:45 - 16:15Room: C105
Authors (first author is the speaker)
| 1. | Ákos Orosz
|
| Department of Computer Science and Systems Technology, University of Pannonia | |
| 2. | Ferenc Friedler
|
| Széchenyi István University |
Abstract
P-graph framework has been developed to provide structure oriented mathematical basis for process network synthesis. During the more than three decades since its first appearance, it has been extended with various capabilities, and has been applied to several real-world case studies. These applications include e.g., transportation networks, reaction network synthesis, and processing systems. In some of the applications, reversible operations may appear. In the previous works, these cases are modeled as two distinct options, representing the two possible directions of operations. However, since only one of the two directions can appear in the synthesized process, additional algorithmic constraints were required.
The current work proposes the extension of the P-graph framework with non-directed operations, that appear in the model as a single operating unit, and selecting their direction can be handled implicitly by the combinatorial algorithms, without the need of additional constraints. The work presents the extended formalism and the modified algorithms for problems where some or all operations are reversible. The methods are demonstrated through case studies and the results are compared with the traditional P-graph-based methods.
Keywords
- Global optimization
Status: accepted
Back to the list of papers