A real-coded hybrid genetic algorithm (HGA) was designed by hybridizing the simple genetic algorithm and simplex algorithm to solve unconstrained optimization problems.
将简单遗传算法与单纯形法相杂合,设计了一种实数编码的混合遗传算法(HGA),用于求解无约束优化问题。
Methods of building linear programming mathematical model for feed compounding and main procedure of realizing improveds simplex algorithm with computer are presented in this paper.
本文首先阐述了如何建立饲料配方的线性规划数学模型,以及用计算机实现改进单纯形算法的主要步骤。
The systematic optimization for the MEKC separation of PTC amino acids by using a dynamic scouting optimization method controlled weighted centroid variable size simplex algorithm was established.
采用控制加权可变步长单纯形算法对PTC氨基酸的毛细管胶束电动色谱分离体系进行动态优化。
This paper makes improvement on the criterion of choosing basic variable in simplex algorithm and gives out a new selecting criterion.
本文就单纯形算法选取入基变量的準则进行改进,给出一种新的选取入基变量的準则。
To get the parameters「value of ESO, a method based on simplex algorithm is put forward, and the common process to get the parameters」value of ADRC is also given based on a lot of simulations.
研究ADRC参数整定方法,提出一种基于单纯形优化的扩张状态观测器参数整定法,并根据大量仿真试验提出ADRC参数整定的一般步骤。
This paper discusses how to solve dynamic routing problem with simplex algorithm in a long-distance telecommunication switch network. The computed results are shown in the paper.
探讨了如何在长途电话交换网中应用单纯形算法解决动态路由问题,并介绍了算法运行情况和运行结果。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
Based on the in-depth analysis of genetic algorithm and simplex algorithm and with the combination of the two, the paper proposes the simplex immune hybrid algorithm.
在深入分析免疫算法和单纯形法的基础上,将两种算法有机结合,提出单纯形免疫算法。
Thus, we propose a hybrid Immune algorithm (IA) based heuristic containing a simplex algorithm as a sub-search process.
为此,本文提出用一个基于模型特性,包含子搜索过程的混合免疫算法来对问题进行优化。
The symmetric difference decomposition method gives an algorithm for the former problem (§4), which is equivalent to the revised simplex algorithm for linear programming.
用对称差分解法自然得到一个算法(§4),相当于改进单纯形算法。
In this paper, a revised simplex algorithm with lower and upper bounds is used for solving the problem of active power security control which is one kind of the security constrained optimization.
本文利用带上、下界的修正单纯形法,求解安全约束最优化问题之一的有功安全校正问题。
A kind of simplex algorithm that its constringency coefficient and expanding coefficient are been changing appropriately in the process of searching optimization values is developed.
研究一种收缩系数和扩展系数适时适当变化的单纯形优化学习算法。