1) simplex searching algorithm
单纯搜索算法
1.
This algorithm imports simplex searching algorithm,saving best result algorithm and eliminating near best result algorithm based on niche selection technology.
它在小生境技术的基础上引入单纯搜索算法、最优保存算法和近优淘汰算法,并使之相互结合。
2) simplex search algorithm
单纯形搜索算法
1.
Conclude the kernel idea of simplex search algorithm.
总结单纯形搜索算法的核心思想。
3) simple search method
单纯搜索法
1.
The influences of the temperature and azeotrope agent on the yield were studied by simple search method.
分离工艺的较优化条件为 :原料经 -5～ 0℃冷冻 4 8h后真空抽滤出液体 ,与石油醚共沸蒸馏 ,经单纯搜索法确定回流比为 4∶ 1 ,m (共沸剂 )∶m(滤饼 ) =1 。
4) simplex search method
单纯型搜索法
1.
Optimization of technological conditions of synthesize hydrogenated rosin glycerin ester by simplex search method;
单纯型搜索法优化氢化松香甘油酯的合成条件
2.
Butyl acetate was synthesized using ammonium ferric sulfate dodecahydrate as catalyst, and the optimum condition for the esterification was obtained by simplex search method.
以十二水合硫酸铁铵为催化剂 ,采用单纯型搜索法研究了乙酸正丁酯合成优化工艺条件 ,转化率达到97。
3.
Tri(n butyl) citrate was synthesized with ammonium ferric sulfate dodecahydrate as catalyst,and the technological condition for the esterification systhesis was optimized by the simplex search method.
以十二水合硫酸铁铵为催化剂 ,采用单纯型搜索法优化柠檬酸三丁酯的合成工艺条件 ,产率达到97。
5) unidirectional searching algorithm
单向搜索算法
1.
A hybrid genetic algorithm (HGA) composed of the standard genetic algorithm (SGA) and the unidirectional searching algorithm(USA)is proposed, not only taking their advantages of time saving, high efficiency and powerfully local searching capability of unidirectional searching algorithm, but also having the advantages of globally searching capability of genetic algorithm(GA).
提出一种离散变量结构优化设计的单向搜索算法并与标准遗传算法结合成混合遗传算法,即发挥了单向搜索算法省时、高效、局部搜索能力强的特点,又发挥了遗传算法全局性好的特点。
2.
A hybrid genetic algorithm (HGA) composed of the standard genetic algorithm (SGA) and unidirectional searching algorithm(USA) is proposed,taking their advantages of time saving,high efficiency and powerfully local searching capability of USA, as well as the global searching capability of genetic algorithm(GA).
提出一种离散变量结构优化设计的单向搜索算法并与标准遗传算法结合成混合遗传算法,即发挥了单向搜索算法省时、高效、局部搜索能力强的特点,又发挥了遗传算法全局性好的特点·算例结果表明,该方法能直接计算具有应力约束和截面尺寸约束的离散变量结构优化设计问题,也能处理同时具有稳定约束和位移约束的多工况、多约束、多变量的离散变量结构优化设计问题·这种混合遗传算法优于标准遗传算法和单向搜索算法,是兼二者之长,弃二者之短的高效的理想优化设计方法
6) single boundary searching algorithm
单边界搜索算法
补充资料：单纯性算法
单纯形法是一种迭代算法，其基本原理及主要步骤是：首先设法找到一个（初始）基可行解，然后再根据最优性理论判断这个基可行解是否最优解。若是最优解，则输出结果，计算停止；若不是最优解，则设法由当前的基可行解产生一个目标值更优的新的基可行解，再利用最优性理论对所得的新基可行解进行判断，看其是否最优解，这样就构成一个迭代算法。由于基可行解只有有限个，而每次目标值都有所改进，因而必可在有限步内终止。如果原问题确有最优解，必可在有限步内达到，且计算量大大少于穷举法；若原问题无最优解，也可根据最优性理论及时发现，停止计算，避免错误及无效运算。
是20世纪十大经典算法之一
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条