查询词典 optimization problem

The optimization of broadcast network is a very important problem in communication networks.

中文摘要：广播网络的优化是通讯网络中的一个比较重要的问题。

This paper describes a fast and efficient Fixed Heuristic Algorithm for unequal circle packing test problem with equilibrium constraint and all best known optimization solutions.

本文针对一类特殊的已知全部最优解的带平衡约束的圆形Packing考题求解，报告了一种基于不适合多边形(No-Fit-Polygon， NFP)的确定性启发式算法(Fixed Heuristic Algorithm，简称FHA)。

To improve the adaptation to the environment of classifier is the key problem for optimization design of classifier.

如何提高分类器对环境的适应能力，是分类器优化设计的关键问题。

The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.

最大团问题是组合优化中的一个经典的NP-完全问题。

The idea of zero cost cycle is devised to solve the critical problem of minimum cost flow. Additional related results obtained include: the theory of bottleneck analysis based on minimum cost augmentation chain and zero cost cycle; the proof of the existence condition and the coherence condition of bottlenecks based on network output; methods to solve various kinds of process bottlenecks; the development of the algorithms of optimization and bottleneck analysis of MCPN (i. e, MCPN-CBA1 and MCPN-CBA2); a series of scheduling strategies and algorithms based on cost analysis, profit evaluation and bottlenecks of process flow line.

四。提出了基于工艺流程成本分析、利润评价的两类生产网络模式：最小成本生产网络和最大利润生产网络；首次提出零成本圈的概念，从而提出并研究了最小费用流的临界问题；创建了基于最小成本增广链、零成本圈的瓶颈分析理论，证明了过程瓶颈的存在性条件以及基于网络加工量的瓶颈一致性条件；给出了求解各类瓶颈的关键技术，研究开发了MCPN的瓶颈分析算法MCPN-CBA1、MCPN-CBA2；提出了一系列基于工艺流程成本分析、利润评价及过程瓶颈的调度策略和调度算法。

We propose an ant colony optimization algorithm to solve this problem.

我们提出了蚁群算法算法来解决这个问题。

An optimization model for combinatorial double auction based on integer programming method is established and transformed into single-sided auction,which will benefit to solve combinatorial double auction with the method used for single-sided auction and to make the problem much more easier.

本文运用整数规划的方法建立了一个组合双向拍卖问题的一般化模型，并通过逐步转化，把组合双向拍卖简化为单边拍卖，有助于利用求解单边拍卖的方法来求解复杂的双向拍卖问题，使这一问题的研究得到了简化。

The maximum flow problem is one of the classical combinatorial optimization problems.

最大流问题是一个经典的组合优化问题。

The Chinese Traveling Salesman Problem is one of combinatorial optimization problems, and is a NP.

中国旅行商问题是一个组合优化问题，是一个NP问题。

The primary work of this paper includes: 1 The general process and the fundamental theory of genetic algorithm is introduced systematically, which is also be applied to an example; 2 The penalty function method and the constraint tournament method are introduced in the paper, which are used to process the constraint limit. Via analyzing the basic principle of NSGA-II ,which is elaborated in the paper, the fast non- dominated sorting method, congestion distance and its comparison operator, the elite strategy and the main process of NSGA-II is researched particularly. 3 Via modeling the fire distribution problem, the model is computed by the algorithm of NSGA-II, which is combined with both the penalty function method and the restraint league tournament method The optimization of two goals are also realized in the paper. The results derived from the VC++6.0 indicate that, two algorithms both have the high convergence, simultaneously the Pareto optimal solution also maintain the variety of distribution.

本文所作的主要工作如下：系统地介绍了遗传算法的一般流程和基本理论，并应用于一个函数优化的实例；研究了用于处理约束限制的罚函数法和约束联赛法，论述了NSGA-II的基本原理，并对其提出的快速非支配排序法、拥挤度及其比较算子、精英策略及NSGA-II的主要流程作了详细的研究；建立了火力分配问题的模型，并将NSGA-II算法分别与罚函数法和约束联赛法相结合对该模型进行了计算，实现了对两个目标的最优化；用VC++6.0编程计算后所得的结果表明，两种算法均具有很好的收敛性，同时Pareto最优解也保持了好的多样性分布。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新