A discrete particle swarm optimization algorithm for rectilinear branch pipe routing
Article publication date: 27 September 2011
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.
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.
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.
This paper applies the Steiner tree theory and develops a DPSO algorithm to plan the aero‐engine rectilinear branch pipe‐routing layouts.
Liu, Q. and Wang, C. (2011), "A discrete particle swarm optimization algorithm for rectilinear branch pipe routing", Assembly Automation, Vol. 31 No. 4, pp. 363-368. https://doi.org/10.1108/01445151111172952
Emerald Group Publishing Limited
Copyright © 2011, Emerald Group Publishing Limited