Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

  • Authors:
  • Qiang Liu;Chengen Wang

  • Affiliations:
  • Liaoning Province Key Laboratory of Multidisciplinary Optimal Design for Complex Equipment, Northeastern University, Shenyang, 110819, China;Liaoning Province Key Laboratory of Multidisciplinary Optimal Design for Complex Equipment, Northeastern University, Shenyang, 110819, China

  • Venue:
  • Enterprise Information Systems - Information Integration Infrastructures Supporting Multidisciplinary Design Optimisation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles ESMTO problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation PSO, and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.