查询词典 optimization

Researches for VSP can promote the development of the theory and method of combinatorial optimization, which is also the basis of building the modern scheduling and commanding system and intelligence transportation system.

论文对VSP的基本问题——旅行商问题的模型与启发式算法进行了分析与总结，为VSP的研究提供了基础。论文在分析纯装或纯卸的非满载VSP的数学模型的基础上，进行了以下研究

All of the research results can be widely applied in various aspect of social practice, and provide a good research way and method for combinatorial optimization problem with parameter and inverse symmetric transportation problem, promote the research of network programming design, help to get farther research results, enrich the theory treasury of systems engineering.

这些研究成果可以广泛应用于社会实践的各个方面，并为含参数的组合优化问题的研究、组合优化问题的逆问题的研究提供了一个很好地研究思路和方法，推动了网络规划设计方法的研究工作，有助于取得进一步的研究成果，丰富系统工程理论宝库。

It is generally used in combinatorial optimization problem.The TS method performs a "guided search" which enables it to escape from local optima.

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

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.

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

Scheduling is a kind of important combinatorial optimization problem.

排序问题是一类重要的组合最优化问题。

This problem can be modeled as a combinatorial optimization problem as follows.

这一问题可以归结为一个组合优化问题如下。

Scheduling problem is one important class of combinatorial optimization problem.

排序问题是一类重要的组合优化问题。

It can be boiled down to combinatorial optimization problem in mathematics.

这是一种复杂的带性能约束的立体空间布局问题，在数学上可以归结为组合最优化。

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.

作业车间调度问题是一个典型的NP难问题，是最困难的组合优化问题之一。

He TSP is one of the typical NP-hard problems in combinatorial optimization problem.

SP问题是最经典的NP-hard组合优化问题之一。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。