| 1. | Ga - sa based mixed - model u - shaped assembly line balancing
基于分支定界方法的双边装配线平衡 |
| 2. | Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解优化问题的重要方法。 |
| 3. | 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
计算表明,在保证求得最优解的前提下,该平台能很好地提高分支定界算法的效率。 |
| 4. | This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分两部分，第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。 |
| 5. | The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。 |
| 6. | To improve the efficiency of the branch and bound technique , some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同时，为提高分支定界法的效率，利用启发式规则剪去产生最优解可能性很小的分支。 |
| 7. | In addition , in consideration of the non - convex and non - concave nature of the combinational optimization sub - problem , the branch and bound technique is adopted to obtain or approximate the global optimal solution
针对组合优化子问题的非凸非凹性，采用分支定界法，以求得或接近全局最优解。 |
| 8. | In this thesis , the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency
本文设计实现的一种专用于计算分支定界算法的机群计算平台,能减少分支定界算法的计算时间复杂度,提高分支定界算法的效率。 |
| 9. | Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm
近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。 |
| 10. | 2 . presenting a modified branch and bound algorithm by adding the heuristic algorithm in the cluster which increasing the efficiency of eliminating node . 3 . the problem ’ s scale is decreased through using distributed parallel computing algorithm
2 .详细研究了几种主要的启发式算法,并使用启发式算法修改了分支定界算法,在保证计算精度的前提下,提高了分支节点的淘汰效率。 |
