We improve on the encoding schema of GA to solve JSP, it reduces occurrence of the unfeasible scheduling solution, then enhances the quality of GA.
由此,提出了遗传算法求解作业车间调度新的编码方法,能够彻底避免产生不可行调度解,大大提高了遗传算法的质量。
There are a number of unfeasible scheduling solutions in the Job-shop Scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms(GA) searching for the best solution.
在作业车间调度问题中,存在大量的不可行调度解,严重影响了遗传算法查找 最 优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
在作业车间调度问题中,存在大量的不可行调度解,严重影响了遗传算法查找最优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
在作业车间调度问题中,存在大量的不可行调度解,严重影响了遗传算法查找最优调度的质量。
应用推荐