Applying graph matching techniques to enhance reuse of plant design information

This article investigates how graph matching can be applied to process plant design data in order to support the reuse of previous designs. A literature review of existing graph matching algorithms is performed, and a group of algorithms is chosen for further testing. A use case from early phase plant design is presented. A methodology for addressing the use case is proposed, including graph simplification algorithms and node similarity measures, so that existing graph matching algorithms can be applied in the process plant domain. The proposed methodology is evaluated empirically on an industrial case consisting of design data from several pulp and paper plants.

Keywords

Design reuse, Engineering design, Inexact graph matching, Node similarity, Process plant, Pulp and paper

DOI

10.1016/j.compind.2019.01.005

Citation

Rantala , M , Niemistö , H , Karhela , T , Sierla , S & Vyatkin , V 2019 , ' Applying graph matching techniques to enhance reuse of plant design information ' , Computers in Industry , vol. 107 , pp. 81-98 . https://doi.org/10.1016/j.compind.2019.01.005

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202103312743

Collections

[article-cris] Sähkötekniikan korkeakoulu / ELEC

Show all metadata