基于序优化的嵌套分区算法  

Combined Nested Partitions Algorithm Based on Ordinal Optimization

作　　者：武维[1] 卫军胡[1] 管晓宏[1] 

机构地区：[1]西安交通大学制造系统国家重点实验室、智能网络与网络安全教育部重点实验室、系统工程研究所,西安710049

出　　处：《系统仿真学报》2009年第11期3176-3179,共4页Journal of System Simulation

基　　金：国家自然科学基金(60736027,60704033);863高科技计划(2007AA04Z154);陕西省自然科学基础研究计划(2007F41)

摘　　要：介绍了嵌套分区算法(NP)的基本思想,从理论上分析了NP算法的计算效率,提出了提高其优化效率的途径。介绍了序优化算法(OO),并将序优化的思想引入嵌套分区算法的可行域确定和希望指数选取算子中,给出了复合嵌套分区算法(OONP)的寻优思路。OONP算法将序优化思想集成到嵌套分区算法框架下,把两者的指数收敛能力结合起来,具有科学性和可行性。通过优化算例验证表明,该算法大大提高了优化效率。The main ideas of nested partitions （NP） method were introduced, its efficiency was theoretically analyzed and a way was proposed to improve the optimization efficiency of the algorithm. Then the ordinal optimization （OO） algorithm was introduced and the ideas of OO were incorporated into the determining of feasible region and the estimating of the promising index. The combined OONP algorithm was analyzed that drew on the two optimization methods. The OONP algorithm adopted the exponential convergence rate ability of OO algorithm and NP algorithm, so that it improved the efficiency and feasibility. Simulation results demonstrate the OONP algorithm.

关 键 词：嵌套分区算法 序优化 仿真优化 离散事件动态系统 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]