A Hybrid Partheno-Genetic Algorithm Approach to a General Resource-Time Optimization Problem
采用混合单亲遗传算法求解一类资源-时间优化问题

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.