基于遗传算法的最小误工任务数问题求解

Solution of Minimum Tardy Task Problems Based on and Genetic Algorithms

为了解决最小误工任务数问题(MTTP),将遗传算法引入该问题的求解中,基于惩罚函数,讨论了MTTP的遗传算法求解方法。并对genGA,ssGA,cGA三种演化式算法求解MTTP的实验运行结果进行分析比较,得出在解决大规模的MTTP时,genGA明显优于另两种演化式算法。

In order to solve the minimum tardy task problem（ MTTP）, the genetic algorithm was led into the solution of it. The solution method of MTTP based on genetic algorithm was discussed by using penalty function. By analyzing and comparing the results of experimental runs of three evolutionary algorithms genGA, ssGA, cGA , it was obtained that the genGA is better than others when solving MTTP with large scale.