A heuristic solution algorithm based on sensitivity analysis is designed for the model proposed.
针对所提出的模型，设计了基于灵敏度分析的求解算法。
Since it is difficult to solve quasi-variation inequality, the paper designs a heuristic solution algorithm based on cha…
鉴于拟变分不等式求解比较困难，设计了基于混沌优化方法的启发式求解算法。
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.
本文提出组密钥分发的最小准确覆盖问题，并证明一种启发式的解。
Since it is difficult to solve quasi-variation inequality, the paper designs a heuristic solution algorithm based on chaos met...
鉴于拟变分不等式求解比较困难，设计了基于混沌优化方法的启发式求解算法。
For the bilevel programming model, this paper designs a heuristic solution algorithm based on particle swarm optimization technique.
然后基于粒子群优化技术，设计一个启发式求解算法。
A programming model and the heuristic solution algorithm are proposed to solve the reserve capacity problem of optimal signal control.
给出了最优信号控制条件下城市交通离散网络设计问题备用能力的优化模型及其启发式求解算法。
A bilevel programming model and heuristic solution algorithm is proposed to model the continuous equilibrium network design problem with elastic demand.
采用双层规划模型描述弹性需求条件下的连续平衡网络设计问题，设计了近似解的启发式算法。
A bilevel programming model and heuristic solution algorithm based on sensitivity analysis is proposed to model the continuous equilibrium network design with elastic demand.
本文采用双层规划模型描述基于弹性需求的连续平衡网络设计问题，设计了基于灵敏度分析法的启发式求解算法，并给出了一个简单的算例。
In order to search for the optimizing solutions of tool switching problem effectively, a beam search based heuristic algorithm is put forward for formulating heuristic solution space of the problem.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。
Pick a branch heuristic to use while searching for a solution.
选择搜索解决方案时要使用的启发式分支。
This paper studies the dynamic hoist scheduling problem and proposes a heuristic method, which method solves the dynamic problem through the solution of a series of static problems.
研究了单抓钩动态排序的问题，提出一个启发式算法，该算法是通过解一系列静态问题来解动态问题的。
The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
A modified light diffusion solution model was proposed from a heuristic version of beam spreading (BS) model and diffusion approximation (DA) theory.
受到光束扩散模型和漫射近似理论的启发，提出了一种改进的光传输求解模型。
A heuristic method is then proposed to construct a feasible solution of the original problem.
然后依据对偶问题的解，以启发式方法构作原问题的可行解。
In order to improve the search efficiency, this paper presents an optimization solution based on heuristic search algorithm and applies it in the original system successfully.
针对该问题，提出基于启发式搜索算法的查询优化方案并成功应用于原有的查询系统。
For satisfying the requirements of the time and space, it is reasonable and natural to compute certain sub-optimal feasible solution, and heuristic methods are designed based on such an idea.
为了满足求解此问题的时间、空间要求，寻找某个次优的、可有效计算的可行解成为自然而合理的办法。启发式方法就是基于这一思想所设计出的。
By combining heuristic rule and case, we put forward a collision solution support technique by integrating case-based and rule-based reasoning.
通过将启发式规则和事例相结合，提出了一种基于规则和事例混合推理的冲突解决支持技术。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
On the basis of improved heuristic cluster local search, branch and cut method is used to get the global optimal solution.
在改进的启发式群局部搜索的基础上 ，利用分枝剪枝法得到全局最优解 。
For NP-complete combination optimization problems, there is no efficient algorithm to the solution of the problems. Consequently, heuristic algorithms may be used to solve such type of problems.
对于NP -完全的组合优化问题，至今尚无很好的解析算法，一般采用启发式算法来解决。
Combining a heuristic random searching strategy with local optimal algorithms is effective solution for complex optimization problem.
启发式随机搜索策略和局部优化算法相结合的求解方案是解决复杂函数优化的有效途径。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
The article gives a detailed introduction to the successive heuristic ideas and means among the solution of mathematical problem, and specific examples given.
结合具体的例子，对数学教学中逐次渐进的思想和方法作了详细的介绍。
In accordance with the research and analysis on the features of refined oil distribution plan, the paper presents its mathematic model and designs an effective solution based on heuristic algorithm.
通过对成品油配送计划特点的研究与分析，建立了成品油配送计划编制的数学模型；并设计了模型求解方案；通过对实验结果的分析，证明本文设计的算法快速、有效、稳定。
In accordance with the research and analysis on the features of refined oil distribution plan, the paper presents its mathematic model and designs an effective solution based on heuristic algorithm.
通过对成品油配送计划的分析，提出了成品油配送计划两阶段编制方法并建立了每个阶段的优化模型，同时对模型的求解方法进行了分析探讨。
Computing time is greatly decreased and the global optimal solution is gained by using hybrid heuristic progressive optimality approach to unit commitment.
将该启发式方法与逐步动态优化法相结合进行机组最优组合，使计算时间大为减少，同时可保证得到最优解。
Computing time is greatly decreased and the global optimal solution is gained by using hybrid heuristic progressive optimality approach to unit commitment.
将该启发式方法与逐步动态优化法相结合进行机组最优组合，使计算时间大为减少，同时可保证得到最优解。
应用推荐