布局问题是一个组合最优化问题。
目的研究神经网络在组合最优化问题中的应用。
Aim \ to study some applications of a neural networks in combinatorial optimization.
三维布局问题属于NP完全问题和组合最优化问题。
Problems of 3d layout belong to NP-complete problem and problem of combinatory optimization.
由于现实中组合最优化问题的解析解一般是无法求得的，所以通常能做的是求解问题的近似解。
However, the analytical solutions to the optimal portfolio problem are not obtained generally in practical market. What we can do in general is to get the approximations of this problem.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
研究了漏检情况下多传感器多目标检测中的数据关联问题，并将其描述为数学规划中组合最优化问题。
This paper studies the problem of data association in multisensor multitarget detection under the condition of leakage and describes it as combinatorial optimization in mathematical programming.
求解tsp问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。
Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.
电力系统机组组合问题是一个典型的大规模混合整数的非线性组合优化问题，很难得到理论上的最优解。
Power system unit commitment, a problem of nonlinear commitment optimization with typical large-scale hybrid integers, is difficult to get an optimal solution in theory.
板材排样优化的核心问题是规划零件在板型原材料上最佳的下料组合与每个下料零件在板材上的最优布局方案。
The kernel of this problem is to programming the best nesting combination and the best composition scheme of each part on the blank sheet.
由于排课问题是一个NP完全的组合优化问题，采用遗传算法来搜索其近似最优解。
For the Course Dispatching problem is a NP-Completed combination optimization problem, I design a Genetic Algorithms to search its proximate optimum solution.
顺序存取设备的最优存储是组合优化中的一个重要问题。
It is well-known that the optimal storage on sequential access peripheral problems is a fundamental problem in combinatorial optimization problems.
本文针对常规遗传算法缺点，根据具体问题的特征，对火电厂内机组优化组合中的遗传算法从各个环节进行了改进，实例计算表明，该方法收敛性好、适应性强、能更有效地达到或接近全局最优。
To the weakness of Genetic Algorithm(GA)and based on the character of the practical question, a refined GA is presented in this paper to optimize the unit commitment in the thermal power plant.
在解决像旅行商这类组合优化中的NP完全问题，是极易陷入早熟收敛，城市规模越大越难求得最优解。
GA easily traps in permutation for (NP-hard) problem such as TSP, especially when the city scale is large.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
为此，建立了两类常见的资金限制情况下的最优组合决策问题的优化模型，并举例进行了计算。
The optimal models for capital rationing under limited capital are established and some examples are calculated.
由于该问题是一个NP -完全组合优化问题，随着问题规模的扩大，往往难以求得最优或满意的机器配置方案。
As it is a NP-complete combinatorial optimization problem, it is difficult to obtain the optimal or satisfying solution with the increase of the problem scale.
由于该问题是一个NP -完全组合优化问题，随着问题规模的扩大，往往难以求得最优或满意的机器配置方案。
As it is a NP-complete combinatorial optimization problem, it is difficult to obtain the optimal or satisfying solution with the increase of the problem scale.
应用推荐