点击次数：
第一作者：Hexiang YUAN
通讯作者：Jiapeng YU
合写作者：Duo JIA,Qiang LIU,Hui MA
发表刊物：Frontiers of Mechanical Engineering
期号：4
卷号：16
所属单位：Key  Laboratory  of  Vibration  and  Control  of  Aero-Propulsion  System (Ministry  of  Education),
摘要：External  pipe  routing  for  aero-engine  in limited  three-dimensional  space  is  a  typical  nondeterministic polynomial hard problem, where the parallel layout of pipes  plays  an  important  role  in  improving  the  utilization of  layout  space,  facilitating  pipe  assembly,  and  maintenance.  This  paper  presents  an  automatic  multiple  pipe routing  method  for  aero-engine  that  focuses  on  parallel layout.  The  compressed  visibility  graph  construction algorithm  is  proposed  first  to  determine  rapidly  the  rough path and interference relationship of the pipes to be routed. Based  on  these  rough  paths,  the  information  of  pipe grouping  and  sequencing  are  obtained  according  to  the difference  degree  and  interference  degree,  respectively. Subsequently,  a  coevolutionary  improved  differential evolution  algorithm,  which  adopts  the  coevolutionary strategy, is used to solve multiple pipe layout optimization problem. By using this algorithm, pipes in the same group share  the  layout  space  information  with  one  another,  and the  optimal  layout  solution  of  pipes  in  this  group  can  be obtained  in  the  same  evolutionary  progress.  Furthermore, to eliminate the minor angle deviation of parallel pipes that would  cause  assembly  stress  in  actual  assembly,  an accurate  parallelization  processing  method  based  on  the simulated  annealing  algorithm  is  proposed.  Finally,  the simulation  results  on  an  aero-engine  demonstrate  the feasibility and effectiveness of the proposed method.
项目来源：the  Major  Projects  of  Aero-engines  and  Gas  Turbines
关键字：multiple  pipe  routing, optimization algorithm, aero-engine, pipe grouping, parallel layout
论文类型：SCI JCR Q1
论文编号：10.1007/s11465-021-0645-3
学科门类：工学
一级学科：机械工程
页面范围：798-813
ISSN号：2095-0233, 2095-0241
是否译文：否