查询词典 discrete optimization

In this paper, a Robust Discrete Optimization model of elevator group control system is presented for dealing with the uncertainty in elevator traffic flow and computational complexity in scheduling. Based on RDO theory, we propose a new elevator group scheduling Algorithm. Comparison is carried between the RDO algorithm and other scheduling algorithms under the virtual simulation platform of elevator group scheduling.

针对电梯群控调度过程中交通流的不确定性和优化求解复杂性问题，本文通过建立电梯群控调度系统的鲁棒离散优化模型，实现了一种基于鲁棒离散优化理论的新的电梯群控优化调度算法。

Then, we use an adaptation of branch-and-bound methods to solve the remaining discrete optimization problem.

然后，我们使用了一个适应的分枝定界方法来解决剩余的离散优化问题。

Ant colony algorithm is a novel evolutionary algorithm originally designed for discrete optimization problem, and has good performance.

蚁群算法作为一种较新的随机性算法在离散组合领域取得了较好的效果，本文对这种算法进行了研究，并提出了一种改进的蚁群算法。

Hybrid coding differential evolution algorithm is a new effective way for solving the discrete optimization problem.

混合编码差异演化算法是求解离散约束优化问题的一种有效方法。

Using a new range encoding mapping,the differential evolution algorithm can be used to deal with discrete optimization problem.

其次，利用一种新的区间编码映射机制，将差异演化算法扩展到求解离散领域优化问题。

Moreover this paper introduced them to a new discrete optimization area: expert assignment problem.

此外，本文还将这两种算法成功应用到一个新的领域——专家分配问题。

Simulation results demonstrated that this method could effectively solve discrete optimization problem with lower cost.

通过实例计算和结果比较，说明该算法能有效地解决此类离散优化问题，降低成本，提高效率，所得解质量较高，有很好的实用价值。

A novel particle presentation for the discrete optimization problem was proposed. Hybrid strategy of Genetic Algorithm was used to extend PSO to improve its performance.

利用遗传算法中的杂交策略扩展了粒子群优化算法，提高了粒子群优化算法性能。

For solving discrete optimization problem using DE,based on the idea of mathematic transform,the concepts of adjuvant search space and individual hybrid encoding are advanced.

接着，给出了HBDE的依概率收敛和完全收敛的定义，并利用离散Markov随机理论证明了HBDE是完全收敛的。

To solve the unit commitment that is a typical non-convex, nonlinear, high-dimensional and discrete optimization problem, a binary adaptive differential evolution algorithm is proposed.

针对机组组合这一典型的非凸、非线性、高维、离散的优化问题，提出了一种二进制自适应微分进化算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。