Applying graph matching techniques to enhance reuse of plant design informationVisa övriga samt affilieringar
2019 (Engelska)Ingår i: Computers in industry (Print), ISSN 0166-3615, E-ISSN 1872-6194, Vol. 107, s. 81-98Artikel i tidskrift (Refereegranskat) 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.
Ort, förlag, år, upplaga, sidor
Elsevier, 2019. Vol. 107, s. 81-98
Nyckelord [en]
Design reuse, Engineering design, Inexact graph matching, Node similarity, Process plant, Pulp and paper
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Kommunikations- och beräkningssystem
Identifikatorer
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
Anmärkning
Validerad;2019;Nivå 2;2019-02-18 (svasva)
2019-02-182019-02-182019-09-13Bibliografiskt granskad