遗传算法求解有约束组合优化问题是对目标函数在整个遗传空间中搜索满足约束条件的可行解。
GA to solve constrained optimization problem is searching the feasibility answers satisfied the constraint condition in the global genetic type space.
通过启发式搜索算法使增加的额外约束得到最大化满足，从而寻找到符合用户意图的解。
The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
摘要：算法利用网络中每个节点的状态信息，通过选择探测的方法搜索满足业务带宽和时延约束要求的路由。
Absrtact: This algorithm depends on the local state of each node in the networks, searches routes that meet bandwidth and delay requirements through the selective probe method.
应用推荐