Engineering Rules-based Pipe Routing Algorithm for Aero-engines

2011 ◽  
Vol 47 (05) ◽  
pp. 163 ◽  
Author(s):  
Qiang LIU
Keyword(s):  
Routing Algorithm ◽  
Pipe Routing ◽  
Aero Engines

Engineering Rules-Based Orthogonal and Variable-Steps Pipe Routing Algorithm for Aero-Engines

2012 ◽  
Vol 442 ◽  
pp. 104-108
Author(s):  
Xiao Lan Bai ◽  
Yu Zhang
Keyword(s):  
Routing Algorithm ◽  
Specific Flow ◽  
Memory Space ◽  
Fast Search ◽  
3D Space ◽  
Cylindrical Coordinate ◽  
Pipe Routing ◽  
Search Speed ◽  
Aero Engines

Pipe routing is to design the routes for pipes in 3D space, meeting various constraints and engineering rules. This paper proposes the engineering rules-based orthogonal and variable-steps pipe routing algorithm. Firstly, the cylindrical coordinate system was adopted to describe the layout space and obstacles. In view of two endpoints of the pipe and obstacles in between, the local searching space was built. Then, the searching algorithm was given according to engineering rules, which was involved with the orthogonal searching directions and their order, the searching variable-steps. Moreover, the specific flow of this algorithm was described. The algorithm requires less memory space and has a fast search speed. The case study shows it is feasible and effective.

scholarly journals Gradient-Based Pipe Routing Tool for Aero-Engines

2020 ◽  
Author(s):  
Daniel Krsikapa ◽  
Luke Crispo ◽  
Kee Seung Oh ◽  
Il Yong Kim
Keyword(s):  
Pipe Routing ◽  
Gradient Based ◽  
Aero Engines

A New Pipe Routing Approach for Aero-Engines by Octree Modeling and Modified Max-Min Ant System Optimization Algorithm

2016 ◽  
Vol 34 (1) ◽  
pp. 11-19 ◽  
Author(s):  
Y.-F. Qu ◽  
D. Jiang ◽  
X.-L. Zhang
Keyword(s):  
Optimization Algorithm ◽  
System Optimization ◽  
Ant System ◽  
Solution Quality ◽  
Dynamic Update ◽  
Pipe Routing ◽  
Efficiency And Effectiveness ◽  
Speed Up ◽  
Aero Engines ◽  
Number Of Bends

AbstractAero-engines usually contain a lot of pipes and cables which have an important influence on product performance and reliability. In this paper, a new pipe routing approach for aero-engines is proposed. First, an adaptive octree modeling method is presented according to the characteristics of the layout space. After considering three types of engineering constraints, the total length of pipelines, the total number of bends and the natural frequency of pipelines are modeled as the optimal objective. Then, a Modified Max-Min Ant System optimization algorithm (MMMAS), which uses layered node selection and dynamic update mechanism, is proposed for pipe routing. For branch pipelines, ant colony searches in groups and parallel to improve the solution quality and speed up the convergence greatly. Finally, numerical comparisons with other current approaches in literatures demonstrate the efficiency and effectiveness of the proposed approach. And a case study of pipe routing for aero-engines is conducted to validate this approach.

A new pipe routing method for aero-engines based on genetic algorithm

2013 ◽  
Vol 228 (3) ◽  
pp. 424-434 ◽  
Author(s):  
Tao Ren ◽  
Zhi-Liang Zhu ◽  
Georgi M Dimirovski ◽  
Zhen-Hua Gao ◽  
Xiao-Huan Sun ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Pipe Routing ◽  
Routing Method ◽  
Aero Engines

Research on the Automatic and Optimized Pipe Routing Layout for Aero-Engines Based on Improved Artificial Fish Swarm Algorithm

2013 ◽  
Vol 437 ◽  
pp. 275-280 ◽  
Author(s):  
Yu Zhang ◽  
Xiao Lan Bai
Keyword(s):  
Rapid Development ◽  
Local Optimum ◽  
Artificial Fish Swarm Algorithm ◽  
Pipe Routing ◽  
Aero Engine ◽  
Artificial Fish Swarm ◽  
Swarm Algorithm ◽  
Aero Engines ◽  
The Mathematical Model

With the rapid development of aerospace industries, how to realize the automatic and optimized pipe-routing layout for the aero-engine has become a hot issue to be urgently solved. For the issue, a novel automatic and optimized pipe-routing layout method based on the improved artificial fish swarm algorithm was put forward in this paper. First, the mathematical model of the pipe-routing layout problem was established. Then, in view of the deficiencies of the artificial fish swarm algorithm,chaos mutation was used to carry out easy and rapid searching as well as robust escape from the local optimum,and gradient setting was used to raise the convergence speed and the solving accuracy.Further, the improved artificial fish swarm algorithm was applied to the pipe-routing layout for the aero-engine. At the end, the effectiveness and feasibility of the proposed method was proved by a case study.

Pipe-Routing Algorithm for Pipelines with Branches

2007 ◽  
Vol 10-12 ◽  
pp. 430-434
Author(s):  
H.B. Feng ◽  
Y.L. Fu ◽  
R. Li
Keyword(s):  
Optimal Trajectory ◽  
Routing Algorithm ◽  
Solution Space ◽  
Pso Algorithm ◽  
Search Range ◽  
Swarm Optimization ◽  
Space Experiments ◽  
Pipe Routing ◽  
Electromechanical Product ◽  
Modified Pso

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.

Research on Information Extraction in Pipe-Routing Layout Space for Complex Products

2012 ◽  
Vol 155-156 ◽  
pp. 250-254
Author(s):  
Xiao Lan Bai ◽  
Yu Zhang
Keyword(s):  
Information Extraction ◽  
Free Space ◽  
Extraction Method ◽  
Spatial Information ◽  
The State ◽  
Complex Products ◽  
Pipe Routing ◽  
Aero Engines ◽  
Flow Of Information

The extraction of information in the layout space is a basis and key to realize automatic pipe-routing layout for complex products such as aero-engines. This paper proposes the filling-surrounding spatial information extraction method. The layout space was first divided into several regions according to the location of accessories, which resulted in the parallel extraction of information in the layout space. Then by means of the filling idea, accessories in each region were filled one by one. After accessories’ rough containing boxes were determined, each accessory and free space was represented with discrete points by using grids to divide the rough containing box. Finally, the outside-in surrounding scanning was used for the rough containing box to identify the state of spatial points. In addition, the flow of information extraction and the storage mode of the extracted information were given. The case study illustrates its feasibility and effectiveness.

Sign in / Sign up

Export Citation Format

Share Document