An improved particle swarm optimization algorithm embedded with greedy search for solution of unit commitment.
求解机组组合问题的嵌入贪婪搜索机制的改进粒子群优化算法。
The optimization result of instance shows that the improved algorithm introduced can converge to the globally optimal solution effectively , it is valuable at product assembly scheduling.
实例调度优化结果表明：改进遗传算法能有效求解产品装配优化调度问题，在产品装配生产中有一定的应用价值。
For satellite data transmission scheduling problem (SDTSP) restrained with time Windows and resources, ant colony optimization algorithm based on solution construction graph model is proposed.
针对具有时间窗口和数传资源限制卫星数传调度问题，提出了基于解构造图模型的蚁群优化算法。
The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
The optimization result of multi-peak value function shows that the algorithm presented can solve premature convergence problem effectively and converge to the globally optimal solution.
多峰值函数优化结果表明，该算法可以有效地解决早熟收敛问题，更易达到全局最优解。
To get the optimum solution for the planning, I construct a model of resource optimization for spliced network planning, and design Adaptive Ant Colony Algorithm to solve it.
为得到最优计划方案，针对搭接网络计划，建立了资源均衡优化的数学模型，并设计了自适应蚁群系统的求解算法与实现过程。
On Optimal Solution of HuaRong Road, such as search strategy, data structures, algorithm optimization, programming are discussed. , then we analyze the results of program.
本文讨论了有关华容道问题最优解的搜索策略、数据结构、算法优化及程序设计，并对程序运行结果作了分析。
In order to improve the search efficiency, this paper presents an optimization solution based on heuristic search algorithm and applies it in the original system successfully.
针对该问题，提出基于启发式搜索算法的查询优化方案并成功应用于原有的查询系统。
The optimization result of multi-peak value function shows that the algorithm introduced can converge to the globally optimal solution effectively.
多峰值函数优化结果表明，该算法能更有效地达到全局最优解。
The paper applies ant colony algorithm to network planning time-cost optimization problems, thereby getting a accurate, comprehensive and efficient solution optimization method.
文章将蚁群算法应用于计划调度的工期-费用优化问题之中，得到一种精确、全面，求解效率高的优化方法。
For the bilevel programming model, this paper designs a heuristic solution algorithm based on particle swarm optimization technique.
然后基于粒子群优化技术，设计一个启发式求解算法。
Compared with standard Particle Swarm Optimization in four typical test functions, results show that our algorithm has potential to find a better solution.
与标准粒子群算法在四个典型测试函数上进行了比较，实验结果表明该算法有很好的潜力找到更好的解。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
采用线性矩阵不等式技术，将问题转化为一线性凸优化算法，可得问题的全局最优解。
We present an algorithm for the solution of general inequality constrained optimization problems.
我们提出一个一般不等式约束优化问题的求解算法。
The generation expansion optimization is high dimension, nun-linear, randomness problems. The convention algorithm hardly finds the best solution.
电源优化问题具有高维数、非线性、随机性等特点，常规的优化算法难以求解到最优解。
Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.
通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。
This paper presents new algorithm for detecting the solution infeasiblity in reactive power optimization calculation based on nonlinear homogeneous interior point method.
该文基于非线性同伦内点法提出了检测无功优化不可行问题的新算法。
In this paper, a trust region algorithm for general nonlinear equality constrained optimization problems, is presented. The solution of their subproblems is easy.
对一般非线性等式约束最优化问题提出了一种信赖域算法，其子问题较易求解。
For NP-complete combination optimization problems, there is no efficient algorithm to the solution of the problems. Consequently, heuristic algorithms may be used to solve such type of problems.
对于NP -完全的组合优化问题，至今尚无很好的解析算法，一般采用启发式算法来解决。
As a kind of search algorithm is fairly fit for solution to the problem of reactive power optimization.
遗传算法是一种基于自然选择和遗传机制的搜索算法，比较适合于求解电力系统无功优化问题。
The solving method for the optimal solution of the overbooking model is given based on chaos optimization algorithm.
基于混沌优化算法给出了求解最优超订水平的方法。
At the same time, homotopy algorithm is applied in the solution of non-linear equation of plane link curve, it enlarges the convergence range of optimization process steadily.
同时，在求解连杆曲线非线性方程组中引入同伦算法，使算法具有大范围收敛性，从而保证了优化过程的稳定收敛。
At the same time, homotopy algorithm is applied in the solution of non-linear equation of plane link curve, it enlarges the convergence range of optimization process steadily.
同时，在求解连杆曲线非线性方程组中引入同伦算法，使算法具有大范围收敛性，从而保证了优化过程的稳定收敛。
应用推荐