首页> 外文会议>International Conference on Computer-aided Material and Engineering >Flexible Job Shop Scheduling Multi-objective Optimization Based on Improved Strength Pareto Evolutionary Algorithm
【24h】

Flexible Job Shop Scheduling Multi-objective Optimization Based on Improved Strength Pareto Evolutionary Algorithm

机译:基于改进强度帕累托进化算法的灵活作业商店调度多目标优化

获取原文

摘要

Scheduling for the flexible job shop is very important in fields of production management. To solve the multi-objective optimization in flexible job shop scheduling problem (FJSP), the FJSP multi-objective optimization model is constructed. The cost, quality and time are taken as the optimization objectives. An improved strength Pareto evolutionary algorithm (SPEA2+) is put forward to optimize the multi-objective optimization model parallelly. The algorithm uses a new model of a Multi-objective genetic algorithm that includes more effective crossover and could obtain diverse solutions in the objective and variable spaces to archive the Pareto optimal sets for FJSP multi-objective optimization. Then an approach based on fuzzy set theory was developed to extract one of the Pareto-optimal solutions as the best compromise one. The optimization results were compared with those obtained by NSGA-II and POS. At last, an instance of flexible job shop scheduling problem in automotive industry is given to illustrate that the proposed method can solve the multi- objective FJSP effectively.
机译:灵活作业商店的计划在生产管理领域非常重要。为了解决灵活作业商店调度问题(FJSP)中的多目标优化,构建了FJSP多目标优化模型。成本,质量和时间被视为优化目标。提出了一种改进的强度Pareto进化算法(SPEA2 +),以并行优化多目标优化模型。该算法使用多目标遗传算法的新模型,包括更有效的交叉,并且可以在目标和可变空格中获得不同的解决方案,以存档用于FJSP多目标优化的Pareto最佳集合。然后开发了一种基于模糊集理论的方法,以提取一个帕累托最佳解决方案之一,作为最佳折衷。将优化结果与NSGA-II和POS获得的结果进行了比较。最后,提供了汽车行业的灵活作业商店调度问题的一个例子来说明所提出的方法可以有效地解决多目标FJSP。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号