Applying graph matching techniques to enhance reuse of plant design information

Research output: Contribution to journalArticleScientificpeer-review

Standard

Applying graph matching techniques to enhance reuse of plant design information. / Rantala, Miia; Niemistö, Hannu; Karhela, Tommi; Sierla, Seppo; Vyatkin, Valeriy.

In: Computers in Industry, Vol. 107, 01.05.2019, p. 81-98.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{bd1ed07351a94581891674a80feee009,
title = "Applying graph matching techniques to enhance reuse of plant design information",
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.",
keywords = "Design reuse, Engineering design, Inexact graph matching, Node similarity, Process plant, Pulp and paper",
author = "Miia Rantala and Hannu Niemist{\"o} and Tommi Karhela and Seppo Sierla and Valeriy Vyatkin",
year = "2019",
month = "5",
day = "1",
doi = "10.1016/j.compind.2019.01.005",
language = "English",
volume = "107",
pages = "81--98",
journal = "Computers in Industry",
issn = "0166-3615",
publisher = "Elsevier",

}

RIS - Download

TY - JOUR

T1 - Applying graph matching techniques to enhance reuse of plant design information

AU - Rantala, Miia

AU - Niemistö, Hannu

AU - Karhela, Tommi

AU - Sierla, Seppo

AU - Vyatkin, Valeriy

PY - 2019/5/1

Y1 - 2019/5/1

N2 - 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.

AB - 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.

KW - Design reuse

KW - Engineering design

KW - Inexact graph matching

KW - Node similarity

KW - Process plant

KW - Pulp and paper

UR - http://www.scopus.com/inward/record.url?scp=85061207989&partnerID=8YFLogxK

U2 - 10.1016/j.compind.2019.01.005

DO - 10.1016/j.compind.2019.01.005

M3 - Article

VL - 107

SP - 81

EP - 98

JO - Computers in Industry

JF - Computers in Industry

SN - 0166-3615

ER -

ID: 32154623