首页> 外文会议>International Conference on Learning and Intelligent Optimization >Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem
【24h】

Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem

机译:自适应多目标本地搜索算法,用于排列频道调度问题

获取原文

摘要

Automatic algorithm configuration (AAC) is an increasingly critical factor in the design of efficient metaheuristics. AAC was previously successfully applied to multi-objective local search (MOLS) algorithms using offline tools. However, offline approaches are usually very expensive, draw general recommendations regarding algorithm design for a given set of instances, and does generally not allow per-instance adaptation. Online techniques for automatic algorithm control are usually applied to single-objective evolutionary algorithms. In this work we investigate the impact of including control mechanisms to MOLS algorithms on a classical bi-objective permutation flowshop scheduling problem (PFSP), and demonstrate how even simple control mechanisms can complement traditional offline configuration techniques.
机译:自动算法配置(AAC)是高效地养的设计中越来越关键的因素。 AAC先前已成功应用于使用离线工具的多目标本地搜索(Mols)算法。但是,离线方法通常非常昂贵,绘制关于给定实例集的算法设计的一般建议,并且通常不允许每个实例的自适应。用于自动算法控制的在线技术通常应用于单目标进化算法。在这项工作中,我们调查在经典的双目标置换流程调度问题(PFSP)上的MOLS算法中的影响对MOLS算法的影响,并演示了简单的控制机制甚至可以补充传统的离线配置技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号