It maintains the serial sequence that the simulated annealing requires, and converges to a global optimum solution. And at the same time, it speeds up...
既确保了模拟退火的串行顺序，使解趋于最优，又缩短了达到最优所需时间，提高了并行计算效率。
It maintains the serial sequence that the simulated annealing requires, and converges to a global optimum solution. And at the same time, it speeds up the solution...
既确保了模拟退火的串行顺序，使解趋于最优，又缩短了达到最优所需时间，提高了并行计算效率。
Meanwhile, we use a fast simulation annealing algorithm in the inversion, which can overcome the limitation of the local extremum of objective function, and acquire a global optimum result.
同时，在具体反演中使用快速模拟退火算法，可以克服目标函数局部极值的限制，从而获得全局最优解。
Based on those two methods, a new algorithm - Double Propagating Wave algorithm is presented to find a optimum global path.
在这两种方法的基础上，本文提出了基于双波传播算法的全局路径规划方法。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
Mining is a complex process. The global optimum decision for mines can be regarded as a complex large system.
矿山开采是一复杂的过程，其全局优化决策可视为一个复杂的大系统。
The GA uses a population of points at a time in contrast to the single point approach by the traditional ones, and will guarantee to find the global optimum.
与经典优化算法不同的特点在于，遗传算法是从多个初始点开始寻优，沿多路径搜索实现全局或准全局最优。
In the paper, the problem of computing discrepancy in the LH design is studied, a lower-bound of discrepancy is obtained, and the global optimum LH design is studied.
本文对LH设计编差的计算进行了研究，并得到了LH设计偏差的下界，对寻求整体最优LH设计进行了讨论。
Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data.
通过对大量数据进行统计，用交互迭代的方法求出全局最优解。
So firstly to get a better estimation of parameter using iterate inversion on wide scale, then using this estimation as initial value on mini scale till to get global optimum of original problem.
因此可先在粗尺度上迭代反演，得到一个较好的参数估计，再将这个估计作为较精细尺度的初值进行反演，直至原问题的全局最优解。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
After every basic mutation, crossover and competition, a new competition with a random swarm is added so as to effectively jump out of the local optimum and enhance the ability of global search.
在每一代变异、交叉和竞争之后，又增加了与随机新种群的竞争操作，使算法易于跳出局部最优点，以提高全局搜索能力。
Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data. Real processing results indicate that the meth...
通过对大量数据进行统计，用交互迭代的方法求出全局最优解。
Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data. Real processing results indicate that the meth...
通过对大量数据进行统计，用交互迭代的方法求出全局最优解。
应用推荐