英汉例句

• it can be applied to solve in many combinatorial optimization problems.

  它能应用到求解许多组合优化问题。

• the assignment problem is a kind of combinatorial optimization problems.

  分配问题是一个组合优化问题。

• optimal placement of switch device is a combinatorial optimization problem with reliability cost objective function.

  分段开关优化配置是一种以可靠性费用最小为目标函数的组合优化问题。

• i selected the shanghai jiao tong university to continue my study for its best reputation on combinatorial optimization and network scheduling where my research interest lies.

  我选择，上海交通大学继续我的学习为其最佳的信誉在组合优化与网络调度在我的研究兴趣所在。

• redundancy allocation is a combinatorial optimization problem of system design.

  冗余分配是系统设计中的组合优化问题。

• the chinese traveling salesman problem is one of combinatorial optimization problems, and is a np .

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

• distribution network structure planning is a complex combinatorial optimization problem, which is difficult to solve properly by using traditional optimization methods.

  配电网网架规划是一个复杂的组合优化问题，传统的优化方法往往难以解决此类问题。

• ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.

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

• i selected the shanghai jiao tong university to continue my study for its best reputation on combinatorial optimization and network scheduling where my research interest lies.

  i选定上海交大继续我的研究，其最有信誉的组合优化和网络调度那里我的研究兴趣所在。

• in the optimization problem, the more common is combinatorial optimization problem.

  在优化问题中，比较常见的是组合优化问题。

• tabu search(ts) algorithm is one of the global optimization search methods which has strong local search and is applied for a large number of combinatorial optimization problems.

  禁忌搜索算法是一种局部搜索能力很强的全局迭代优化算法，已经被成功地应用到各种组合优化问题中。

• three-dimensional component packing is a combinatorial optimization and np-complete problem. it is difficult to find its exact global optimum.

  三维布局问题属于组合最优化问题和np完全问题，在一定时间内求其精确全局最优解是相当困难的。

• tsp(traveling salesman problem)is a typical np-hard problem in combinatorial optimization and genetic algorithm is one of methods for solving tsp.

  tsp问题是一个经典的np难度的组合优化问题，遗传算法是求解tsp问题的有效方法之一。

• the scheduling of logistic processes is a combinatorial optimization problem.

  物流过程的调度是一个组合优化问题。

• locomotive working diagram is a multi-constraint combinatorial optimization problem.

  机车周转图的编制是多约束条件的组合优化问题。

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

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

• the tabu search (ts)method is one of the modern optimization algorithms developed from local search. it is generally used in combinatorial optimization problem.

  ts算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。

• an artificial immune system is a new intelligent problem-solving technique that is being used for particularly hard combinatorial optimization problems.

  人工免疫是一个新的人工智能技术，在解决组合优化难题方面，表现出了较好的性能。

• ant colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.

  蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。

• layout problem is an important offshoot of operation research; it belongs to complex combinatorial optimization problem.

  布局问题是运筹学的一个重要分支，属于复杂的组合优化问题。

• the maximum flow problem is a classical combinatorial optimization problem.

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

• by the application in a concrete sample, it is indicated that the genetic algorithm provides a new way to solve this complicate combinatorial optimization problem effectively.

  通过在具体实例中的应用表明，采用遗传算法为有效地解决这一复杂组合优化问题提供了一种新途径。

• the integrated design of cellular manufacturing system (cms) is a combinatorial optimization problem.

  单元制造系统的集成设计问题是一个组合优化问题。

• branch and bound algorithm is a general method for solving combinatorial optimization problems. parallelization is an effective means to improve the algorithm performance.

  分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。

• branch-and-cut methods can solve many combinatorial optimization problems, especially large scale problems, for instance, traveling salesman problem(tsp).

  分支-切割法可以用来解决许多组合最优化问题，特别是大规模问题，例如旅行商问题（tsp）。