Applying graph matching techniques to enhance reuse of plant design information

Miia Rantala, Hannu Niemistö, Tommi Karhela, Seppo Sierla*, Valeriy Vyatkin

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

9 Citations (Scopus)
53 Downloads (Pure)

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.

Original languageEnglish
Pages (from-to)81-98
Number of pages18
JournalComputers in Industry
Volume107
DOIs
Publication statusPublished - 1 May 2019
MoE publication typeA1 Journal article-refereed

Keywords

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

Fingerprint

Dive into the research topics of 'Applying graph matching techniques to enhance reuse of plant design information'. Together they form a unique fingerprint.

Cite this