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. 

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

Design reuse

Engineering design

Inexact graph matching

Node similarity

Process plant

Pulp and paper

Dependable Communication and Computation Systems

Kommunikations- och beräkningssystem

Publication and Content Type

ref (subject category)

art (subject category)