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 pipe...

[1]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[2]  Gilles Brassard,et al.  Fundamentals of Algorithmics , 1995 .

[3]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[4]  Byounghak Yang,et al.  A Hybrid Evolutionary Algorithm for the Euclidean Steiner Tree Problem Using Local Searches , 2006, KES.

[5]  Joseph L. Ganley,et al.  Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[6]  Soonhung Han,et al.  A Design Expert System for Auto-Routing of Ship Pipes , 1999 .

[7]  J. Scott Provan.  An Approximation Scheme for Finding Steiner Trees with Obstacles , 1988, SIAM J. Comput..

[8]  Teruaki Ito,et al.  A genetic algorithm approach to piping route path planning , 1999, J. Intell. Manuf..

[9]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  Jin-Hyung Park,et al.  Pipe-routing algorithm development: case study of a ship engine room design , 2002, Expert Syst. Appl..

[11]  Wei Chen,et al.  GAPRUS—genetic algorithms based pipe routing using tessellated objects , 1999 .

[12]  Qiang Liu,et al.  Pipe‐assembly approach for aero‐engines by modified particle swarm optimization , 2010 .

[13]  G. Yan,et al.  An-OARSMan: obstacle-avoiding routing tree construction with good length performance , 2005, ASP-DAC '05.

[14]  Ross E. Swaney,et al.  Optimization of process plant layout with pipe routing , 2005, Comput. Chem. Eng..

[15]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[16]  Yuehong Yin,et al.  A pipe route design methodology by imitating human imaginal thinking , 2010 .

[17]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[18]  Qiang Liu,et al.  Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation , 2012, Enterp. Inf. Syst..

[19]  Xinghuo Yu,et al.  An intelligent system for automatic layout routing in aerospace design , 2007, Innovations in Systems and Software Engineering.

[20]  Kyu-Yeul Lee,et al.  Rapid generation of the piping model having the relationship with a hull structure in shipbuilding , 2007, Adv. Eng. Softw..

[21]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[22]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.