您要查找的是不是:
- Finally, this algorithm is applied to some test problems and it has the better results than using the penalty function algorithm. 最后,本算法应用于几个典型例题,并与罚函数法相比较,数值结果表明该算法是可行的,有效的。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 对于二层规划问题有许多经典的求解方法,如极点搜索法、分支定界法和罚函数法等。
- Hyperbolic Cosine Penalty Function Algorithm 双曲余弦罚函数法
- Convergence of Penalty Function Algorithm in Time Optimal Control Problem 受约束时间最优控制问题罚函数法收敛性分析
- penalty function algorithms 罚函数算法
- penalty function algorithm 罚函数代数算法
- Penalty function method for solving constrained (minimum) optimization problem of a class of better algorithms. 罚函数方法是求解约束(极小)优化问题的一类较好的算法。
- In the Genetic Algorithm, penalty function is often used to deal with constrains. 摘要在遗传算法中,约束的处理一般采用罚函数法。
- Combined with exact non-differentiable penalty function, a new chaos genetic optimization algorithm is presented. 并结合精确不可微罚函数求解非线性约束优化问题,提出了求解此类问题的混沌遗传算法。
- It confirms the movement equation of particle and adopts death penalty function to deal with all constraint term, and provides with the step of algorithms to solve 0/1 knapsack problem. 确定了该算法中粒子的运动方程,采用死亡罚函数法处理了约束条件,给出了该算法求解0/1背包问题的实现步骤,并对实验数据进行了测试。
- By means of the penalty function method and the project variable metric algorithm, we obtain a revised method with its global convergence and superlinear convergence rate. 利用罚函数和投影变尺度方法,得到了一个修正的算法及其全局收敛与超线性收敛率。
- In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem. 摘要将带有死亡罚函数的二进制粒子群优化算法应用于0/1背包问题。
- Furthermore.The theory about penalty function method of bilevel multiobjective programming is established. 在单层化的基础上,建立了两层多目标规划的罚函数理论。
- Firstly, we can convert the constraint LMIP into unconstraint one by using the penalty function. 通过构造一种罚函数化有约束的LMIP为无约束或简单约束的LMIP。
- Penalty function is introduced in the adaptive value function to speed up the convergence of the algorithm and ensure that the assignment reduction includes fewer attributes with stronger support. 在交叉规则中,采用了单点交叉,最大迭代代数被作为停止准则,算法获得较佳的搜索效果。
- An improved floating-point coded genetic algorithm controlled by information entropy is presented to solve the constrained optimization problems based on the quasi-exact penalty function. 在用准精确惩罚函数处理约束优化问题的基础上,提出一种基于浮点数编码机制的信息熵控制多种群遗传算法。
- Lastly, PWL predictive control which uses the upper bound of optimal control as penalty function under certain conditions is proved to be stable. 最后证明了在一定条件下将最优控制的上限作为PWL系统预测控制的最终惩罚项可使预测控制算法保持稳定。
- This thesis analyses thecommon penalty function method and modified coulomb friction model used for contactanalysis in sheet metal forming simulation. 分析了常用的罚函数法接触算法和用于板料成形数值模拟的修正库仑摩擦模型。
- Through multiple generation calculation, the minimum point of penalty function value was obtained, then the optimalc reduction distribution was found. 通过粒子群多代运算,求出罚函数值最小点,得到压下负荷最佳分配点。
- By introducing penalty function terms,the problems,which would arise in the case of pure Lagrange multiplier method or penalty function method. 通过附加惩罚函数项,克服了单纯使用拉格朗日乘子法或惩罚函数法时存在的问题。