用于堆芯换料方案优化的区间限界算法的改进及验证  

Improvements of Interval Bound Algorithm for Reactor Reloading Pattern Optimization and Their Verifications

作　　者：宫兆虎[1] 姚栋[1] 王侃[2] 王明利[1] 

机构地区：[1]中国核动力研究设计院核反应堆系统设计技术重点实验室,成都610041 [2]清华大学工程物理系,北京100084

出　　处：《核动力工程》2012年第5期6-11,共6页Nuclear Power Engineering

摘　　要：区间限界算法是一种性能较好的堆芯换料方案优化方法。为进一步提高该算法的性能,本文在原算法基础上添加"精英策略",数值结果表明,算法的收敛速度和优化解的质量都得到了提高。为了处理多模态换料方案优化问题,又为算法添加了多区间模型,数值结果表明,在不增加计算量的前提下算法具备了多模态优化能力。使用了这2种改进方法后,区间限界算法的工程实用性得到进一步增强。Interval Bound Algorithm is a well performance algorithm to optimize reactor reloading pattern problem. In order to improve the performance of the algorithm further, this paper added “elitism strategy” to it. The numerical result showed that the improved algorithm became better than the basic algorithm in terms of both solution quality and convergence speed. Moreover, in order to solve multi-modal reloading pattern optimization problem, the multi-interval-model was added to the algorithm. The numerical result also illustrated that the re-improved algorithm was able to find multi-modal optimization solutions simultaneously without increasing of calculation load. With the two improvement measures, Interval Bound Algorithm has Performed better in realistic aoolication.

关 键 词：换料方案优化 区间限界算法 精英策略 多模态优化 

分 类 号：TK121[动力工程及工程热物理—工程热物理]