摘要
利用DNA计算和遗传算法求解Job-Shop调度问题最优解的有效性和实用性的特点,提出了一种实现Job-Shop调度的DNA遗传算法,该方法将基于调度优先的人工DNA应用于遗传算法的矩阵编码,解决了常规遗传算法的编码方式和局部收敛问题.对该方法与在满足约束条件下采用的常规遗传算法进行了模拟仿真计算与对比,结果表明,该算法避免了陷入局部最优并最终趋于全局最优.
Make use of DNA Computing and Genetic Algorithms to get optimal solutions of practical and effective features of Job-shop scheduling,put forward a DNA Genetic Algorithm to realize Job-Shop Scheduling.This method applies artificial DNA based on scheduling priority to matrix encoding of genetic algorithm,thus solving problems of encoding and local convergence of routine genetic algorithm.Simulation calculation and comparison were made between this method and routine genetic algorithm when meeting needs of constraint conditions.The result showed this DNA genetic algorithm is not only avoids being trapped in part but also inclines to whole optimality eventually.
出处
《机械设计与制造》
北大核心
2010年第5期43-45,共3页
Machinery Design & Manufacture
基金
国家863计划资助项目(2007AA04Z111)
关键词
DNA计算
遗传算法
调度优化
DNA computing
Genetic algorithm
Scheduling optimization
