求解资源约束问题的启发式遗传算法

Solving Resource Constraint Problem Using Heuristic Cenetic Algorithms

本文提出了一种求解基于特定约束优化问题(COP)的启发式遗传算法(HGAs).通过一种特殊的编码方式以及基于问题的搜索方法,有效地解决了GAs操作的不合法问题.并且从时间复杂度上看该算法也是切实可行的.

In this paper, A heuristic genetic algorithm is proposed based on a domain - specific constraint optimization problem. After using a special coding and a searching method based on domain - specific problem, We have accelerated the convergence speed in the algorithm, solved the illegal GAs operation problem effectively, made the solving of the model effective and feasible. The algorithm can be applied to the solving of optimization problems based on this kind of resource constraint.