Branch pipe routing based on 3D connection graph and concurrent ant colony optimization algorithm
Pipe routing, in particular branch pipes with multiple terminals, has an important influence on product performance and reliability. This paper develops a new rectilinear branch pipe routing approach for automatic generation of the optimal rectilinear branch pipe routes in constrained spaces. Firstly, this paper presents a new 3D connection graph, which is constructed by extending a new 2D connection graph. The new 2D connection graph is constructed according to five criteria in discrete Manhattan spaces. The 3D connection graph can model the 3D constrained layout space efficiently. The length of pipelines and the number of bends are modeled as the optimal design goal considering the number of branch points and three types of engineering constraints. Three types of engineering constraints are modeled by this 3D graph and potential value. Secondly, a new concurrent Max–Min Ant System optimization algorithm, which adopts concurrent search strategy and dynamic update mechanism, is used to solve Rectilinear Branch Pipe Routing optimization problem. This algorithm can improve the search efficiency in 3D constrained layout space. Numerical comparisons with other current approaches in literatures demonstrate the efficiency and effectiveness of the proposed approach. Finally, a case study of pipe routing for aero-engines is conducted to validate this approach.
KeywordsPipe routing Branch pipeline 3D connection graph Concurrent Max–Min Ant System
The authors thank the editor and anonymous reviewers for their helpful comments and suggestions. The work was financially supported by the National Natural Science Foundation of China (Grant No. 51175341).
- Asmara, A., & Nienhuis, U. (2006). Automatic piping system in ship. In The 5th international conference on computer and IT applications in the maritime industries, Sieca Repro.Google Scholar
- Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). A new rank based version of the Ant System—A computational study. Central European Journal for Operations Research and Economics, 7(1), 25–38.Google Scholar
- Fan, J., Ma, M., & Yang, X. G. (2003). Research on automatic laying out for external pipeline for aeroengine. Journal of Mechanical Design, 20(7), 21–23. (in Chinese).Google Scholar
- Ganley, J. L., & Cohoon, J. P. (1994). Routing a multi terminal critical net: Steiner tree construction in the presence of obstacles. In Proceedings of IEEE international symposium on circuits and systens (ISCAS), Lundon.Google Scholar
- Hu, X. B. (2004). Research on principles, theory and application of Ant Colony Optimization. Chongqing: Chongqing University.Google Scholar
- Hu, Y., Jing, T., Hong, X., Feng, Z., Hu, X., & Yan, G. (2005). An-OARSMan: Obstacle-avoiding routing tree construction with good length performance. In Proceedings of the 2005 Asia and South Pacific design automation conference. ACM.Google Scholar
- Ren, T., Zhu, Z. L., Dimirovski, G. M., Gao, Z. H., Sun, X. H., & Yu, H. (2013). A new pipe routing method for aero-engines based on genetic algorithm. Journal of Aerospace Engineering. doi: 10.1177/0954410012474134.
- Wu, Y.-F., Widmayer, P., Schlag, M. D. F., & Wong, C. K. (1987). Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Transactions on Computers, 36(3), 321–331.Google Scholar