Abstract: Pipe routing for complex products is very complicated. Besides the pipe path planning algorithm, the routing sequence also exerts remarkable impacts on final pipe layouts. While most previous researchers focus on seeking the pipe paths, few efforts are made on routing sequence planning. The routing sequence planning problem is studied in the context of an aero-engine development, and a Kriging model-based routing sequence planning algorithm is presented. In order to handle the discrete planning problem, a discrete Kriging model with correlation functions optimized by particle swarm optimization is constructed by using a continuous handling method. Based on the constructed Kriging model, the optimal pipe routing sequence is determined by using a discrete particle swarm optimization, which dramatically improves computation efficiency by replacing the path planning algorithm with the Kriging model. The discrete particle swarm optimization is modified to improve the search ability. The proposed planning algorithm has good universality, and the effectiveness and efficiency of which are demonstrated by the simulations.

Key words: Kriging model, Particle swarm optimization, Pipe routing, Routing sequences