查询词典 optimization problem

Raveling Salesman Problem is a classic combined optimization problem and it is proved that TSP is NP hard.

SP问题作为经典的组合优化问题，已经被证明是一个NP难题。

The paper simplifies the joint diagonalization of matrices into optimization problem which only includes the eigen matrix. For solving the problem conveniently, each row vector of the eigen matrix is parameterized, then utilizes the improved genetic algorithm to get the optimal parameter.

摘要该文首先将矩阵联合对角化问题化简成一个只含有特征矩阵的优化问题，为了便于求解，文中将待求特征矩阵的每一列向量进行参数化处理，并利用改进的遗传算法寻找最优的新参数。

By use of first-order linear expansion of Taylor series, the linearization process of both nonlinear constraints and objective function of long-term optimal scheduling model are performed and an optimal scheduling model based on seccessive linear programming is built; an approach to solve Optimal scheduling of cascade hydropower station problem by seccessive linear programming is put forward, the scale-down factor of iteration step length is used to ensure that the algorithm can converge to the optimal solution of optimization problem quickly and accurately.

通过采用泰勒级数一阶描述形式，对优化调度目标函数和约束条件中的非线性约束进行线性化处理，建立了基于连续线性规划算法的优化调度数学模型，提出了用连续线性规划技术求解梯级水电站优化调度问题的算法，并采用迭代步长的动态比例缩减因子保证算法能快速准确地收敛到优化问题的最优解。

Amethod is presented for recovering the shape of scatterer,it reduce theinverse obstacle problem to an optimization problem.

本章给出了一个重建散射区域的一个方法，将反求区域问题归结为一个约束最优化问题。

The shortest path problem is a classical problem of network optimization. Its practical application and theoretic research is valuable.

最短径路是网络优化中的一个经典问题，Dijkstra算法被公认为是一种十分有效的最短径路的搜索求解算法。

Shortest path problem is a basic problem in the combinatorial optimization. The objective in the network is time-varying.

在组合优化过程中，往往需要获得从起点到终点之间的最短路，而其所考虑的目标可能是一个与时间相关的变量。

Key Words: Dynamic network, Time dependent vehicle route problem, Time dependent shortest path problem, route construction algorithm, Genetic Algorithm, Ant Colony Optimization Algorithms, Component-based software development

最后，对本文的主要工作和研究成果进行了总结，并简要讨论了进一步的研究方向。关键词：动态路网，时间依赖型车辆路径问题，动态最短路径问题，构造算法，遗传算法，蚁群算法，组件式开发

The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.

大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。

Traveling Salesman Problem is a typical combination optimization problem,which is easy to be described and hard to be solved.

旅行商问题是一个典型的组合优化问题，易于描述却难于求解。

Layout problem is a combinatory optimization problem.

布局问题是一个组合最优化问题。

Now he worked in ajoint venture.

现在他在一家合资企业工作。

More troops in Afghanistan won't change any of the foregoing.

更多的在阿富汗的军队也不会改变之前的状况。