基于双群体搜索机制分别对约束多目标优化问题和约束单目标优化问题进行了研究。
Hence, constrained multiobjective and constrained numerical optimization problems are done in this thesis based on double populations.
与已有典型算法相比，上述算法提高了PSO算法处理约束多目标优化问题的能力。
Compared with several typical algorithms, our algorithm improves PSO's capability to deal with the constrained multi-objective optimization problems.
配电网重构是一个多目标、 多约束、离散的非线性组合优化问题。
Distribution network reconfiguration is a multi - objective , multi - constraint, discrete nonlinear combinatory optimization problem.
若将加权阵当作设计参数，则控制系统的设计可以表示为一个满足一组不等式约束的多目标优化问题。
With the weighting function matrix as design parameters, the design of a control system can be expressed as a multi-objective optimization problem with inequation constraints.
通过对多目标联合概率数据关联方法性能特征的分析，将其归结为一类约束组合优化问题。
The properties of the joint probabilistic data association(JPDA)are analyzed, and data association is reduced to a sort of constraint combinatorial optimization problem.
故用传统的数学优化算法，难以解决多目标、多约束问题。
So the traditional optimize algorithms is difficult to solve poly-goal, poly-restrain problems.
但由于目标和约束函数的不同，故它又不同于常规的多目标优化问题。
It is a multiobjective optimization design, but the objective and constraint functions are greatly different to traditional optimization design.
现场集装箱装载问题多为多目标、多约束优化的复杂问题。
The container loading problem occurring in on the spot freight production is often with several constraints and objectives, I.
组卷问题是一个多约束多目标组合优化问题。
The test paper generation is a constrained multi-object optimization problem.
采用了一种带附加条件约束的修正线性加权方法来处理多目标优化问题。最后，对上述方法给出了应用实例和计算结果。
To solve such a multi-objective problem, a modified linear weighted sum method with an additional conditional constraint is adopted an…
结合评价函数法将带约束的多目标优化问题转化为无约束优化问题，并给出相应的区间扩张，对相关定理进行了证明。
The paper, combined with evaluation function introduces the transformation of constrained problems into unconstrained ones, and offers an interval extension.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
应用推荐