...
首页> 外文期刊>International Journal on Soft Computing >Multiobjective Flexible Job Shop Scheduling Using A Modified Invasive Weed Optimization
【24h】

Multiobjective Flexible Job Shop Scheduling Using A Modified Invasive Weed Optimization

机译:改进的有创杂草优化算法的多目标柔性作业车间调度

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Recently, many studies are carried out with inspirations from ecological phenomena for developingoptimization techniques. The new algorithm that is motivated by a common phenomenon in agriculture iscolonization of invasive weeds. In this paper, a modified invasive weed optimization (IWO) algorithm ispresented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with thecriteria to minimize the maximum completion time (makespan), the total workload of machines and theworkload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviourof weeds in colonizing and finding suitable place for growth and reproduction. IWO is developed to solvecontinuous optimization problems that’s why the heuristic rule the Smallest Position Value (SPV) is used toconvert the continuous position values to the discrete job sequences. The computational experiments showthat the proposed algorithm is highly competitive to the state-of-the-art methods in the literature since it isable to find the optimal and best-known solutions on the instances studied
机译:近来,从生态现象的启发中进行了许多研究以开发优化技术。由农业常见现象引起的新算法是将入侵杂草定殖。本文提出了一种改进的侵入性杂草优化(IWO)算法,该算法以使目标的最大完成时间(makespan),机器的总工作量和关键机器的工作量最小化为标准,对多目标柔性作业车间调度问题(FJSSP)进行了优化。 IWO是一种受生物启发的元启发法,它模仿了杂草在定居和寻找合适的生长繁殖场所中的生态行为。 IWO旨在解决连续优化问题,这就是为什么使用启发式规则“最小位置值(SPV)”将连续位置值转换为离散作业序列的原因。计算实验表明,所提出的算法与文献中的最新方法相比具有很高的竞争力,因为它能够在所研究的实例上找到最佳和最著名的解决方案

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号