首页> 外文会议>Genetic and evolutionary computation conference >Extrapolation-Directed Crossover for Job-shop Scheduling Problems: Complementary Combination with JOX
【24h】

Extrapolation-Directed Crossover for Job-shop Scheduling Problems: Complementary Combination with JOX

机译:作业商店调度问题的外推 - 跨越:与jox的互补组合

获取原文

摘要

In this paper, we propose a new Genetic Algorithm for JSP using two crossovers. The crossover, JOX, obtained relatively good results, however offspring generated by JOX exist around parents or within an intermediate area of them. This feature of JOX induces a convergence of the whole population. To deal with this fault of JOX, we propose a complementary combination of two crossovers. One is JOX, and the other, EDX, is our proposal. EDX is designed to have the population enlarge using a local search and explores the area where the population uncovers. Although a mutation is applied for exploration in general, we apply a framework of crossover to EDX for a more efficient exploration. The combination of two crossovers, which has a different search area, is able to compensate for each other's fault. The GA designed with these two crossovers was applied to large-size JSP benchmarks, and we show its effectiveness.
机译:在本文中,我们向JSP采用了两个交叉推出了一种新的遗传算法。交叉,jox,获得了相对良好的结果,但是由jox产生的后代存在于父母周围或在它们的中间区域内。 Jox的此特征突出了整个人口的融合。要处理Jox的这种错误,我们提出了两个交叉路口的互补组合。一个是jox,另一个是edx,是我们的建议。 EDX旨在使用本地搜索,探讨人口扩大的人口扩大,探索人口尚未展开的区域。虽然突变被申请探索,但我们将交叉框架应用于EDX,以获得更有效的探索。具有不同搜索区域的两个交叉路引用的组合能够补偿彼此的故障。使用这两个交叉路展面设计的GA适用于大型JSP基准,我们展示了其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号