在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
We also present an algorithm based on implicit enumeration and simplex method on network.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
本文提供了在没有非奇异假设的条件下，求解有界约束半光滑方程组的投影信赖域算法。
In this paper, we propose a projected trust-region algorithm for solving bound-constrained smooth systems of equations.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
The shortest topological distance between two atoms in a structure was designed according to the widely used breadth first search algorithm which uses a data structure called Queue.
采用有限容积法在交错网格上对流动控制方程离散，然后采用SIMPLE算法求解。
The finite volume method is used to discrete the flow controling equations on staggered grid and the SIMPLE algorithm is adopted to solve the equations.
在冷却过程数值模拟的基础上，采用遗传算法对该问题进行求解。
On the basis of numerical simulation of cooling process, we select GA to solve the problem.
随队干扰是现代雷达干扰技术中常见的情况，文中讨论了在随队干扰环境中，通过干扰方程来求解雷达的暴露区的算法。
ESJ is common in the modern radar jamming technology, this paper introduces a calculating method of radars detection area by using jamming equation on the condition of ESJ.
区域分解算法是在并行机上求解偏微分方程数值解的一种方法。
The domain decomposition is a numerically approximating solution to partial differential equations on parallel computers.
本文介绍了遗传算法在辐照控制模型参数求解中的应用，使辐照控制系统不断优化，取得了比较满意的结果。
This paper introduces the application of genetic arithmetic in parameters solution of irradiation control model, which causes constant optimum of irradiation control system and a satisfactory result.
在非理想信道条件下，推导了两部传感器的最优判决规则，并给出了求解最优判决规则的数值迭代算法。
The necessary conditions for optimal sensor decision rules are derived, and a numerical algorithm is designed for finding the optimal sensor decision rules.
综合约束问题求解和回溯控制策略，给出了在粒度分层模型基础上的布局算法。
A layout algorithm based on the multi granularity model was proposed by adopting strategies of both constraint problem solving and backtracking.
求解不可压流体耦合方程的直接解法(CELS算法)，在许多计算问题中体现了其优越性。
CELS (Coupled Equation line Solver) algorithm, which is based on the simultaneous solution for Pressure and velocity along lines, has successfully solved many flow problems.
以前，许多研究都集中在采用启发式算法来求解该问题。
Thus, most previous researchers have focused on developing heuristic algorithms to solve the problem.
通过仅假设出节点处的控制变量值，使该算法在求解最优控制问题时更方便，收敛更快。
Some of the optimal control problems can be solved more quickly and efficiently with the algorithm if only the control variable's values at the knots are given.
实例证明该算法求解加速了收敛过程，提高了搜索效率，在避免陷入局部最优的同时提高了求解精度。
Such an algorithm is verified to accelerate convergence process, enhance searching efficiency and solving precision as well as avoid low efficiency and local optimum.
实验结果表明，GPSO算法在求解旅行商问题上，优化效果明显。
The experimental results demonstrate that GPSO algorithm has obvious optimization effect in solving TSP.
在标定过程中，应用线性算法求解出了镜头的径向畸变系数。
Radial lens distortion coefficient can be obtained by linear algorithm in the calibration.
第三章在ABS算法的基础上给出了求解线性丢番图方程组的整隐式LU算法和整隐式LX算法，讨论了相应的ABS性质，并讨论了复杂性分析及其应用。
In chapter three, the DLU and IILX algorithms for linear Diophantine equations are given based on the ABS algorithms. Corresponding properties, complexity and their application are discussed.
本文在介绍求解复杂组合优化问题而提出的蚁群算法的基础上，提出一种基于连续不确定区域的蚁群算法。
A new sequential uncertainty domain method called SUACO is presented on the basis of ant colony optimization, which is adapted to solve complex combination optimization problems.
采用动态规划法和贪心法对该问题进行求解，分析和比较这两种算法在求解同一问题时的差异。
This paper adopts dynamic programming method and greedy method to solve such problems, then analyzes and compares the differences of two algorithms.
测试结果验证了算法在求解动态车辆调度问题中的有效性。
The test results demonstrate the effectiveness of the RHSA to solve the dynamic vehicle scheduling problem.
同时，在求解连杆曲线非线性方程组中引入同伦算法，使算法具有大范围收敛性，从而保证了优化过程的稳定收敛。
At the same time, homotopy algorithm is applied in the solution of non-linear equation of plane link curve, it enlarges the convergence range of optimization process steadily.
反演过程归结为求解非线性最小二乘问题，在使用阻尼最小二乘法求解中提出了一种新的选取阻尼因子的算法。
The inverse process is equivalent to solve a nonlinear least square problem and a new way to choose damping factor is presented in utilizing the damping least square method.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
应用推荐