Applying graph matching techniques to enhance reuse of plant design information
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2019-05-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
18
Series
Computers in Industry, Volume 107, pp. 81-98
Abstract
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.Description
Keywords
Design reuse, Engineering design, Inexact graph matching, Node similarity, Process plant, Pulp and paper
Other note
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