• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Second ICSC Symposium on Engineering of Intelligent Systems, Jun 27-30, 2000, Scotland, U.K. >MULTIPLICITY AND INCEST PREVENTION IN EVOLUTIONARY ALGORITHMS TO DEAL WITH THE JOB SHOP PROBLEM
【24h】

MULTIPLICITY AND INCEST PREVENTION IN EVOLUTIONARY ALGORITHMS TO DEAL WITH THE JOB SHOP PROBLEM

机译：进化算法中的多重性和收益预防，以解决工作机会问题

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A diversity of optimization problems in fields such as production operations in manufacturing industry, parallel and distributed systems, logistics and traffic can be summarized within the general class of scheduling problems. Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improvements towards convergence issues in EAs include incest prevention and multiplicity of crossovers and parents. This work shows an evolutionary approach using a multiplicity feature MCMP and its further combination with incest prevention MCMPIP, to solve the job shop scheduling problem. To ensure the birth of valid offspring this approach uses a population of decoders. This required the implementation of uniform, occurrence based and fitness based scanning crossovers. Implementation details and a comparison of results for a set of job shop scheduling instances of distinct complexity, using both evolutionary approaches to the problem, are shown.
机译：在调度问题的一般类别中，可以总结出诸如制造行业的生产运营，并行和分布式系统，物流和交通运输等领域中的各种优化问题。进化算法（EA）已成功应用于调度问题。当前在EA中解决趋同问题的改进包括乱伦预防和交叉和父母的多重性。这项工作展示了一种使用多重特征MCMP及其与乱伦预防MCMPIP进一步结合来解决作业车间调度问题的进化方法。为了确保有效后代的出生，此方法使用了大量的解码器。这要求实施统一的，基于事件的和基于适应性的扫描交叉。展示了使用两种针对问题的进化方法的实施细节以及一组具有不同复杂性的作业车间调度实例的结果比较。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号