首页> 外文会议>システム制御情報学会研究発表講演会 >Genetic algorithm by using plural heuristic solutions for solving flow-shop problems
【24h】

Genetic algorithm by using plural heuristic solutions for solving flow-shop problems

机译:遗传算法利用多种启发式解决方案解决流店问题

获取原文

摘要

In our earlier paper, in order to solving large-scale scheduling problems in reasonable computation time, heuristic solutions have been utilized as reference solutions for the crossover operation and the mutation operation. In this paper we propose a new technique for determining the reference solutions from many heuristic solutions and also the chance of changing the reference. The computational result is shown for a flow-shop scheduling problem.
机译:在我们之前的纸张中,为了在合理的计算时间内解决大规模调度问题,启发式解决方案已被用作交叉操作和突变操作的参考解决方案。在本文中,我们提出了一种新的技术,用于从许多启发式解决方案中确定参考解决方案,以及改变参考的机会。将计算结果显示用于流店调度问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号