优化问题

Ant Colony Optimization Algorithm is a novel kind of simulated evolutionary optimization algorithm, which provides a new method for complicated combinatorial optimization problems.

蚁群优化算法是一种新型的模拟进化优化算法，为求解复杂的组合优化问题提供了一种新的思路。

Various efficient, convergent and robust algorithms have been developed for such a SCOP. However, a more general constrained optimization problem with not only logic AND but also OR relationships exists in many practical applications.

但是，在实际应用中有很多更一般的约束优化问题，其等式或不等式约束之间不仅包含逻辑&与&关系，而且还包含逻辑&或&关系，现有的针对标准约束优化问题的各种算法不再适用。

Among them, one of the most promising seems to be Simulation Annealing that aims to reach the optimization of an objective function by physically analogizing to an annealing process of malerial at high temperature. This involves in a transformation of optimization of a function in continuous domain into a combinatorial optimization in discrete domain, as well as the proper choice of various control parameters such as temperature, iterative number etc.

为此，目前主要采用三种基于随机搜索策略的鲁棒技术，其中模拟退火算法是最有希望的一种，该算法的核心思想是随机模拟物理上的物质退火过程，它主要涉及将连续域优化问题转换为离散的组合优化问题，以及合理地选择各种控制参数、迭代时间等。

Comparing with other optimization methods, it needs few mathematical requirements, so it appropriates to deep foundation pit optimization.

与传统搜索方法相比，遗传算法对所求解的优化问题没有太多的数学要求，适用范围更广，适合于解决基坑支护优化问题。

A new combination optimization problem caned China Travelling Salesman Problem is proposed in this paper.

该文提出了一个新的组合优化问题：中国旅行商问题，讨论了用神经网络的原理和方法解决它，提出了智能化的优化方法。

Traveling Salesman Problem is the well-known combination optimizing problem, it colligates the classical typicality of a type of combination optimizing problem, and exists .in VLSI chip manufacture, printing circuit design, X-ray crystallography, robot control and many other high-tech fields. According to N P-completed theory, TSP belongs to NPH, it can't be solved by routine search methods, and different types of solutions must be employed.

旅行商是组合优化中最为著名的问题，它综合了一大类组合优化问题的典型特征，并以不同的形式存在于超大规模集成芯片制造、印刷电路板设计、X-射线结晶学、机器人控制等高科技领域。

Based on this mechanism, a clonal selection algorithm for multi-modal function optimization has been proposed by formulating suitable clonal selection operators and introducing a new niching technology in this paper.

多目标优化问题的解不是唯一的，而是一个最优解集合。这类问题大多有较高维的搜索空间，传统的优化方法会导致很高的时间复杂性。

Quasi-convex relaxation algorithm, which aims to solve ordinary constraint global optimization problems, is produced by a combination of branch-and-bound method with quasi-convex lower bound and quasi-concave upper bound functions developed from quasi convex-concave extension. This algorithm extends the interval algorithm with box constraint to general constraint global optimization problem.

利用拟凸-凹扩张中构造出的函数的拟凸下界函数和拟凹上界函数，与分枝定界方法相结合，建立了求一般约束全局优化问题的拟凸松弛算法，这一算法是将盒子约束的区间算法推广到一般约束优化问题中。

The QoS multicast routing optimization problem was changed into a quasi-continuous problem by using a node series encoding method. Constrained terms in the problem were processed by the penalty function.

该算法采用一种节点序列编码方案，将路由优化问题转化成一种准连续优化问题，并采用罚函数处理约束条件。

To improve solution efficiency,the feasibility of the optimization problem is analyzed to found the parallel environment,and the parallel program of spot-weld optimization is exploited with C++ and Fortran languages.

为了提高求解效率，对优化问题的可并行性进行了分析，搭建并行环境，用C++和Fortran语言开发了焊点优化问题的并行程序。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。