【24h】

AN IMPROVED GENETIC ALGORITHM FOR JSP WITH FUZZY PROCESSING TIME AND DUE-DATE

机译:具有模糊处理时间和到期日的改进JSP遗传算法

获取原文

摘要

Genetic algorithm (GA)for Job-Shop scheduling problem (JSP)with fuzzy processing time and due-date has been getting an increasing attention recently. But slow convergence and low precision still exist in these applications. To improve the performance of the existed GA for JSP with fuzzy processing times and due-date, a new approach(KRGA)is presented in this paper. A new crossover operator is designed, named as keeping-segments-reverse-crossover, which aims to make full use of the excellent quality of the parent chromosomes. The designed new operator can ensure validity and diversification of the evolving descendants, and can improve the accuracy of the optimal solution meanwhile. Through the numerical example of 10×10 Sakawa problem, compared with standard G&T and improved G&T, the feasibility and effectiveness of KRGA are illustrated.
机译:具有模糊处理时间和到期日期的Job-Shop调度问题(JSP)的遗传算法(GA)最近受到越来越多的关注。但是在这些应用中仍然存在慢收敛和低精度的问题。为了提高模糊处理时间和到期日的现有JSP遗传算法的性能,提出了一种新的方法(KRGA)。设计了一种新的交叉算子,命名为keep-segments-reverse-crossover,旨在充分利用亲本染色体的优良品质。设计的新算子可以确保进化后代的有效性和多样性,同时可以提高最优解的准确性。通过10×10 Sakawa问题的数值算例,与标准G&T和改进的G&T相比,说明了KRGA的可行性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号