Pipe-Routing Algorithm for Pipelines with Branches

Abstract:

Article Preview

This paper presents an automatic pipe-routing algorithm for pipelines with branches in an electromechanical product. The algorithm uses chaos theory to establish the chaos grid pre-processing model (CGPM) that can efficiently pick up solution space and reduce the search range. A novel particle swarm optimization (PSO) algorithm is developed to seek for an approximate optimal trajectory in the solution space. Experiments show that the modified PSO algorithm is effective and efficient. The examples demonstrate that the automatic pipe-routing algorithm is effective and practical for pipelines with branches.

Info:

Periodical:

Edited by:

Kai Cheng, Yingxue Yao and Liang Zhou

Pages:

430-434

Citation:

H.B. Feng et al., "Pipe-Routing Algorithm for Pipelines with Branches", Applied Mechanics and Materials, Vols. 10-12, pp. 430-434, 2008

Online since:

December 2007

Authors:

Export:

Price:

$38.00

[1] D. Zhu, Jean-Claude and Latombe: Proceedings of the 1991 IEEE International Conference on Robotics and Automation Vol. 15 (1991), pp. (1940).

[2] J. Park and R.L. Storch: Washington: Expert Systems with Application Vol. 23 (2002), p.299.

[3] R. Guirardello and R.E. Swaney: Computers and Chemical Engineering Vol. 30 (2005), p.99.

[4] K.E. Parsopoulos and M.N. Vrahatis: IEEE Trans. on Evolutionary Computation Vol. 8 (2004), p.211.

[5] A. Ratnaweera, S.K. Halgamuge and H.C. Watson: IEEE Trans. on Evolutionary Computation Vol. 8 (2004), p.240.

[6] N. Higashi and H. Iba: Proceedings of the IEEE Swarm Intelligence Symp Vol. 15 (2003), p.72.

[7] J. Kennedy: Proceeding of the IEEE Swarm Intelligence Symp Vol. 15 (2003), p.53.

[8] T. Krink, J.S. Vesterstrom and J. Riget: Proceedings of the IEEE Int'l Conf. on Evolutionary Computation Vol. 20 (2002), p.1474.

[9] X.H. Hu and R.C. Eberhart: Proceedings of the IEEE Int'l Conf. on Evolutionary Computation Vol. 10 (2002), p.1666.