基于局部穷举迭代的叶片安装排序研究  

Blades Installment Arrangement Research Based on the Partial Exhaustion Iteration Algorithm

作　　者：巴太[1] 郭桂霞[1] 

机构地区：[1]哈尔滨汽轮机厂有限责任公司,哈尔滨150046

出　　处：《汽轮机技术》2006年第2期153-155,共3页Turbine Technology

摘　　要：叶片安装排序在早期采用配对对称安装方法,简便快捷,但精度不高。后来引进的遗传算法,在运算精度取得了不错的成绩,但是运行时间一般在几小时以内,有些偏长。在全排序的基础上,提出了一种局部穷举迭代算法,寻解精度高、运算时间较短,有力满足了汽轮机转子叶片装配的快速安装要求。The blades installment arrangement to use in the early time pairs symmetrically installment method, is simple quickly, but the precision is not high. Afterwards introduced the genetic algorithms, have obtained the good result in the operation precision, but the running time within several hours, some was generally long. This paper in the entire arrangement foundation, proposed one kind of partial exhaustion iteration algorithm, seeks the solution precision high, the operation time is short, powerfully satisfied the turbine rotor blades assembly fast installment request.

关 键 词：局部穷举 迭代 叶片安装 排序 

分 类 号：TK266[动力工程及工程热物理—动力机械及工程]