Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A discrete particle swarm optimization algorithm for rectilinear branch pipe routing

A discrete particle swarm optimization algorithm for rectilinear branch pipe routing Purpose – The purpose of this paper is to develop a new rectilinear branch pipe‐routing algorithm for automatic generation of rectilinear branch pipe routes in constrained spaces of aero‐engines. Design/methodology/approach – Rectilinear branch pipe routing that connects multiple terminals in a constrained space with obstacles can be formulated as a rectilinear Steiner minimum tree with obstacles (RSMTO) problem while meeting certain engineering rules, which has been proved to be an NP‐hard and discrete problem. This paper presents a discrete particle swarm optimization (PSO) algorithm for rectilinear branch pipe routing (DPSO‐RBPRA) problems, which adopts an attraction operator and an energy function to plan the shortest collision‐free connecting networks in a discrete graph space. Moreover, this paper integrates several existing techniques to evaluate particles for the RSMTO problem in discrete Manhattan spaces. Further, the DPSO‐RBPRA is extended to surface cases to adapt to requirements of routing pipes on the surfaces of aero‐engines. Findings – Pipe routing numeral computations show that, DPSO‐RBPRA finds satisfactory connecting networks while considering several engineering rules, which demonstrates the effectiveness of the proposed method. Originality/value – This paper applies the Steiner tree theory and develops a DPSO algorithm to plan the aero‐engine rectilinear branch pipe‐routing layouts. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Assembly Automation Emerald Publishing

A discrete particle swarm optimization algorithm for rectilinear branch pipe routing

Qiang Liu; Chengen Wang
Assembly Automation , Volume 31 (4): 6 – Sep 27, 2011
Download PDF
6 pages

Loading next page...
 
/lp/emerald-publishing/a-discrete-particle-swarm-optimization-algorithm-for-rectilinear-9VkTxqu6yD
Publisher
Emerald Publishing
Copyright
Copyright © 2011 Emerald Group Publishing Limited. All rights reserved.
ISSN
0144-5154
DOI
10.1108/01445151111172952
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to develop a new rectilinear branch pipe‐routing algorithm for automatic generation of rectilinear branch pipe routes in constrained spaces of aero‐engines. Design/methodology/approach – Rectilinear branch pipe routing that connects multiple terminals in a constrained space with obstacles can be formulated as a rectilinear Steiner minimum tree with obstacles (RSMTO) problem while meeting certain engineering rules, which has been proved to be an NP‐hard and discrete problem. This paper presents a discrete particle swarm optimization (PSO) algorithm for rectilinear branch pipe routing (DPSO‐RBPRA) problems, which adopts an attraction operator and an energy function to plan the shortest collision‐free connecting networks in a discrete graph space. Moreover, this paper integrates several existing techniques to evaluate particles for the RSMTO problem in discrete Manhattan spaces. Further, the DPSO‐RBPRA is extended to surface cases to adapt to requirements of routing pipes on the surfaces of aero‐engines. Findings – Pipe routing numeral computations show that, DPSO‐RBPRA finds satisfactory connecting networks while considering several engineering rules, which demonstrates the effectiveness of the proposed method. Originality/value – This paper applies the Steiner tree theory and develops a DPSO algorithm to plan the aero‐engine rectilinear branch pipe‐routing layouts.

Journal

Assembly Automation – Emerald Publishing

Published: Sep 27, 2011

Keywords: Aircraft engines; Pipe routing; Rectilinear paths; Branches; Particle swarm optimization; Steiner tree; Programming and algorithm theory

References

  • Automatic piping system in ship
    Asmara, A.; Nienhuis, U.
  • Fundamentals of Algorithmics
    Brassard, G.; Bratley, P.
  • The particle swarm‐explosion, stability, and convergence in a multidimensional complex space
    Clerc, M.; Kennedy, J.
  • A note on two problems in connection with graphs
    Dijkstra, E.W.
  • Research on automatic laying out for external pipeline for aeroengine
    Fan, J.; Ma, M.; Gao, X.
  • The ant colony optimization for ship pipe route dDesign in 3D space
    Fan, X.; Lin, Y.; Ji, Z.
  • Routing a multi‐terminal critical net: Steiner tree construction in the presence of obstacles
    Ganley, J.L.; Cohoon, J.P.
  • Optimization of process plant layout with pipe routing
    Guirardello, R.; Swaney, R.
  • A solution to line routing problems on the continuous plane
    Hightower, D.W.
  • An‐OARSMan: obstacle‐avoiding routing tree construction with good length performance
    Hu, Y.; Jing, T.; Hong, X.L.; Feng, Z.; Hu, X.; Yan, G.
  • A genetic algorithm approach to pipe route path planning
    Ito, T.
  • A design expert system for auto‐routing of ship pipes
    Kang, S.S.; Myung, S.; Han, S.H.
  • Particle swarm optimization
    Kennedy, J.; Eberhart, R.C.
  • Combinatorial Optimization: Networks and Matroids
    Lawler, E.
  • An algorithm for path connections and its application
    Lee, C.Y.
  • Pipe‐assembly approach for aero‐engines by modified particle swarm optimization
    Liu, Q.; Wang, C.
  • A new rectilinear pipe path planning algorithm: Manhattan visibility graph
    Liu, Q.; Wang, C.
  • Multi‐terminal pipe routing algorithm for aero‐engines by Steiner minimal tree and particle swarm optimization
    Liu, Q.; Wang, C.
  • An algorithm for planning collision‐free paths among polyhedral obstacles
    Lozano‐Pérez, T.; Wesley, M.A.
  • Pipe‐routing algorithm development: case study of a ship engine room design
    Park, J.H.; Storch, R.L.
  • An approximation scheme for finding Steiner trees with obstacles
    Provan, J.S.
  • Rapid generation of the piping model having the relationship with a hull structure in shipbuilding
    Roh, M.I.; Lee, K.Y.; Choi, W.Y.
  • GAPRUS – genetic algorithms based pipe routing using tessellated objects
    Sandurkar, S.; Chen, W.
  • An intelligent system for automatic layout routing in aerospace design
    Van Der Velden, C.; Bil, C.; Yu, X.; Smith, A.
  • A hybrid evolutionary algorithm for the Euclidean Steiner tree problem using local searches
    Yang, B.
  • A pipe route design methodology by imitating human imaginal thinking
    Yin, Y.H.; Zhou, C.; Zhu, J.Y.