采用混合单亲遗传算法求解一类资源-时间优化问题

A Hybrid Partheno-Genetic Algorithm Approach to a General Resource-Time Optimization Problem

针对资源有限最短时间的一类资源 -时间优化问题 ,提出了混合单亲遗传算法进行求解 .作为一类 NP完全问题 ,该问题求解难度相当大 ,尤其问题规模大时寻找最短时间优化解就更困难 .针对问题的特点本文引入的算法结合了启发式规则 ,给出了算法全局收敛的理论分析 。

In this paper, we propose a hybrid partheno-genetic algorithm approach to solve a general resources constrained and shortest time optimization problem. Since the problem is NP complete, it is very hard to find a feasible solution , especially large size ones, let alone the optimal solution. According to the characteristics of the problem, the algorithm we introduce is integrated with heuristic rules. Theoretic analysis shows that the algorithm is of global convergence and the application provided demonstrates it's effectiveness.