Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Applying graph matching techniques to enhance reuse of plant design information
Semantum Oy, Espoo, Finland.
Semantum Oy, Espoo, Finland.
Semantum Oy, Espoo, Finland; Aalto University, Helsinki, Finland.
Aalto University, Helsinki, Finland.
Show others and affiliations
2019 (English)In: Computers in industry (Print), ISSN 0166-3615, E-ISSN 1872-6194, Vol. 107, p. 81-98Article in journal (Refereed) Published
Abstract [en]

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. 

Place, publisher, year, edition, pages
Elsevier, 2019. Vol. 107, p. 81-98
Keywords [en]
Design reuse, Engineering design, Inexact graph matching, Node similarity, Process plant, Pulp and paper
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-72928DOI: 10.1016/j.compind.2019.01.005ISI: 000461269600008Scopus ID: 2-s2.0-85061207989OAI: oai:DiVA.org:ltu-72928DiVA, id: diva2:1289406
Note

Validerad;2019;Nivå 2;2019-02-18 (svasva)

Available from: 2019-02-18 Created: 2019-02-18 Last updated: 2019-09-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Vyatkin, Valeriy

Search in DiVA

By author/editor
Vyatkin, Valeriy
By organisation
Computer Science
In the same journal
Computers in industry (Print)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf