...
首页> 外文期刊>International Journal of Production Research >A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem
【24h】

A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem

机译:通过Levy航班进行的杜鹃混合搜索,查找排列流水车间调度问题

获取原文
获取原文并翻译 | 示例
           

摘要

The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a cuckoo search (CS)-based memetic algorithm, called HCS, is proposed for the PFSSP. To make CS suitable for the PFSSP, a largest-ranked-value (LRV)-rule-based random key is used to convert the continuous position in CS into a discrete job permutation. The Nawaz-Enscore-Ham (NEH) heuristic is then combined with the random initialisation to initialise the population with a certain quality and diversity. After that, CS is employed to evolve nest vectors for exploration, and a fast local search is embedded to enhance the local exploitation ability. In addition, simulations and comparisons based on PFSSP benchmarks are carried out, which shows that our algorithm is both effective and efficient.
机译:置换流水车间问题(PFSSP)是具有广泛工程和理论背景的NP难题。在本文中,针对PFSSP提出了一种基于杜鹃搜索(CS)的模因算法,称为HCS。为了使CS适合PFSSP,基于最大排序值(LRV)规则的随机密钥用于将CS中的连续位置转换为离散的作业排列。然后将Nawaz-Enscore-Ham(NEH)启发式方法与随机初始化方法结合使用,以一定的质量和多样性来初始化总体。此后,利用CS进化嵌套向量进行探索,并嵌入快速局部搜索以增强局部开发能力。此外,基于PFSSP基准进行了仿真和比较,表明我们的算法既有效又高效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号