- 更多网络例句与启发式求解相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Cross Entropy method has recently been proposed as a heuristic method.It shows some simple performance in the process of solving combinatorial optimization problems.This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory.
交叉熵方法是近几年发展而来的一种启发式方法，在求解组合优化问题中显示出其简单有效的特点，将运用交叉熵方法寻求图论中一个典型的NP困难问题—最大割问题的最优解。
-
To speed up the solution of the problem, a solution method that hybridizes heuristic algorithm with conventional branch and bound method is presented.
文中还讨论了采用启发式算法同传统的分枝定界法相结合以提高问题的求解速度，并给出了一个数值例子。
-
This paper describes a fast and efficient Fixed Heuristic Algorithm for unequal circle packing test problem with equilibrium constraint and all best known optimization solutions.
本文针对一类特殊的已知全部最优解的带平衡约束的圆形Packing考题求解，报告了一种基于不适合多边形(No-Fit-Polygon， NFP)的确定性启发式算法(Fixed Heuristic Algorithm，简称FHA)。
-
The paper analyses material transportation problem and give the solvable methods; analyses delivery vehicle route problem, and then construct its corresponding mathematical model and present a heuristic algorithm based on C—W algorithm; analyses the optimum scheduling problem of trucks, and then construct its corresponding mathematical model and put forward a new algorithm; analyses the Postal Transportation Problem which will perhaps be used in supply chain of manufacturing system, and then construct its corresponding mathematical model and present an approximation algorithm.
分析了制造系统供应链中供需平衡、供需不平衡、有转运等各种情况下的物资调运问题，给出了求解方法；分析了制造系统供应链配送作业中的配送车辆路线问题，建立了相应的数学模型，提出了一种基于C-W算法的启发式算法，该算法较好地解决了有时间约束的配送问题；分析了制造系统供应链中的货运卡车优化调度问题，建立了相应的数学模型，提出了一种基于表上作业法的求解算法；分析了制造系统供应链中有潜在利用价值的邮政运输方式问题，在详细描述了该问题的基础上，建立了相应的数学模型，提出了一种近似求解算法，该算法较好地解决了邮政运输方式这样的多种物流、多种运输方式，有严格时限和众多外部约束的特大型、复杂、并行的交连系统的计划调度问题。
-
A lagrangian relaxation heuristic algorithm based on subgradient optimization is applicated to solving the practical scale problems. The solution algorithms solving sub-problems are also listed.
提出了求解实际规模问题的基于次梯度优化的拉格朗日松弛启发式算法，并给出了各子问题的求解算法。
-
A new heuristic solution algorithm is presented using an improved genetic algorithm. In the improved genetic algorithm, nondifferentiable exact penalty functions are used to transform a constrained optimization problem into a single unconstrained optimization problem, and hybrid crossovers and intermittent are applied to increase the search capability.
设计了基于改进遗传算法的启发式求解算法，该算法借助不可微精确罚函数将约束问题转化为单个无约束问题来解决，采用混合杂交和间歇变异提高算法的搜索能力。
-
The multi-stage Tabu Search fits for the situation where the problem has middle size, the quality of solution is important, and the speed is not restricted too much.(4) The combined algorithm which shares the advantages of HR and TS—high speed and high quality—is the most practicable one for middle-scale problems.
通过仿真实验对分枝定界算法、基于运行的启发式算法、多阶段禁忌搜索算法和组合算法进行一系列的对比研究，得出以下几点结论：(1)分枝定界算法只适用于问题规模小且对计算时间要求不高的场合，它是一种最优化算法；(2)启发式算法适合于求解大规模问题，尤其是实际应用中遇到的大型问题，对计算时间要求较高而对解的质量只要满意即可。
-
A model is initially developed based on the in the integer programming, whose objective function is subject to the minimization of the total re-shuffle containers. To reduce the total number of reshuffles for retrieving the containers, a hybrid algorithm, which combines heuristic rule and distributed genetic algorithm, is employed to solve the model. The heuristic rule is to reduce the range of feasible solution and distributed genetic algorithm is to solve the optimization.
该策略以压箱数最少为目标，建立基于整数规划的选位模型；根据发箱时较低翻箱率的要求，采用启发式算法和分布式遗传算法相结合的混合算法求解选位模型；其中启发式规则用于缩小可行解的范围，分布式遗传算法用于求近似最优解。
-
Meanwhile, the method of how to learn macro-operator based on subgoals is also studied. Secondly, the situation of problem solving, in which there are no problem operator model and no any heuristics, is studied.
其次，作者针对无问题操作模型同时也无问题求解启发式信息的情况，研究如何利用训练例子，不断进行问题求解的试探，自动获取操作在不同状态集中的效用信息，形成问题求解的初步规划。
-
Firstly, the situation of problem solving, in which there is problem operator's model but no any heuristics, is studied. The utilities of operators applied in set of states can be obtained through the analysis of operator model, and the problem planning can be makeup in the form of subgoal hierarchic.
首先，作者针对有操作模型但无问题求解启发式信息的问题，研究如何通过自动分析操作模型获取操作在不同状态集中的效用，形成问题求解的初步规划，并利用初步规划的结果逐步求解相关子问题，从而获得整个问题的解。
- 更多网络解释与启发式求解相关的网络解释 [注：此内容来源于网络，仅供参考]
-
lingo：软件
本文结合对合作配送成本控制的论证与分析,采用运筹学方法对合作配送运输网络建立了数学模型--基于时间约束的合作配送运输网络合理化模型,并设计了一种启发式算法,运用这种方法对数学模型进行了求解,最后运用计算机软件(LINGO)对模型及算法进行求解与性能分析,