另外，该算法可有效避免陷入局部最优，也不要求提供初始可行解。
Otherwise, the hybrid algorithm can avoid trapping in local optimum and does not need initial feasible solution.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
在蜂窝单元指派交换机时定义了一系列应用于初始解的移动，以改进费用和建立解的可行性。
This approach defines a series of moves applicable to an initial solution in order to improve the cost and establish the feasibility of the solution.
该算法利用QAP现有算法得到初始解，然后利用局部搜索策略完成解的可行化和优化。
The GFO employs existing algorithms for the QAP to obtain an initial solution, then applies local search to gain feasibility and optimization.
通过对运输问题的约束条件的分析，重新设计了初始种群的生成方法，避免了对大量非可行解的处理。
It proposes a method to product initial feasible solutions of transportation problem, on the basis of its special constrained conditions, and the unfeasible solutions need not to care any more.
通过对运输问题的约束条件的分析，重新设计了初始种群的生成方法，避免了对大量非可行解的处理。
It proposes a method to product initial feasible solutions of transportation problem, on the basis of its special constrained conditions, and the unfeasible solutions need not to care any more.
应用推荐