• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Intelligence: The International Journal of Artificial Intelligence, Neural Networks, and Complex Problem-Solving Technologies >An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion
【24h】

An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion

机译：基于有效的行动置换级别的离散和声搜索方法，用于MakeSpan批判性的灵活作业商店调度问题

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

摘要

The Flexible Job Shop Scheduling Problem (FJSSP) represents a challenging applicative problem for metaheuristic algorithms because it imposes the development of innovative domain-dependent search operators that have to deal both with its combined discrete and permutation nature. Emerging as an effective approach for the resolution of a broad spectrum of hard optimization problems, some few discrete declinations of the Harmony Search (HS) algorithm have been recently proposed for tackling the FJSSP. Recent advances include an investigation of an innovative and promising permutation-based proposal. Accordingly, this paper proposes an Effective Operations Permutation-based Discrete Harmony Search (EOP-DHS) approach for FJSSP with Makespan criterion. The approach adopts an integrated two-part "affectation-sequencing" representation of the solution harmony and a dedicated improvisation operator particularly adapted to the integer-valued and operations permutation-based used coding scheme. Besides, a Modified Intelligent Mutation (MIM) operator is integrated to the adopted framework in order to enhance its overall search ability. Mainly, by balancing maximum machine workload during the overall search process, MIM operator allows essentially maintaining and enhancing the reciprocal equilibrium of diversification and intensification abilities of the proposed EOP-DHS algorithm. Conducted numerical experimentations on 188 benchmarking instances validate the proposal comparatively to a representative set of previously deployed metaheuristic approaches to FJSSP with Makespan criterion. Furthermore, main contribution of the paper is extended with an experimental procedure proving the effectiveness of the adopted permutation-based HS scheme for the resolution of combinatorial optimization problems. Hard benchmarking instances of the classical Job Shop Scheduling Problem (JSSP) are thus considered for exemplification.
机译：灵活的作业商店调度问题（FJSSP）代表了成群质算法的具有挑战性的应用问题，因为它强加了创新的域名搜索运营商的开发，这些搜索运营商必须与其组合的离散和排列性质进行处理。作为一种有效的解决方案的有效方法，最近已经提出了一些与解FJSSP的和声搜索（HS）算法的离散拒绝。最近的进展包括调查创新和有前途的基于豁免的提案。因此，本文提出了一种具有MakEspan标准的FJSSP的基于FJSEP的基于允许的基于允许的离散和声搜索（EOP-DHS）方法。该方法采用溶液和谐的集成两部分“影响测序”表示和专用的即兴运营商特别适用于基于整数和操作置换的使用编码方案。此外，修改过的智能突变（MIM）运算符被集成到采用的框架，以提高其整体搜索能力。主要是通过平衡在整体搜索过程中的最大机器工作负载，MIM运算符允许基本上维护和增强所提出的EOP-DHS算法的多样化和强化能力的互惠平衡。对188个基准测试实例进行了数值实验，验证了与MakeSpan标准的FJSSP的代表性的先前部署的成群质方法集的提案。此外，纸张的主要贡献延长了实验程序，证明了采用基于置换的HS计划的有效性，以解决组合优化问题。因此考虑了典型作业商店调度问题的硬基准实例（JSESP）以用于示例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号