论文部分内容阅读
基于ＳＬＵＬＳＰ问题的性质提出了用遗传算法（ＧＡ）来进行求解．通过１０个随机产生的问题进行实验．结果表明，这１０个问题的平均计算结果与通过动态规划获得的最优解进行比较，近优率平均可达３．２９％以内．
Based on the nature of the SLULSP problem, a genetic algorithm (GA) is proposed to solve the problem. Experiment with 10 randomly generated questions. The results show that the average results of these 10 problems are compared with the optimal solution obtained through dynamic programming. The average near rate can reach 3.29% on average.