首页> 外文会议>International Conference on Advances in Computing >Proposing Modified NSGA-II to Solve a Job Sequencing Problem
【24h】

Proposing Modified NSGA-II to Solve a Job Sequencing Problem

机译:提出修改的NSGA-II来解决作业排序问题

获取原文

摘要

In this paper, a bi-objective job sequencing problem is proposed. The objectives are - 1) total weighted tardiness of jobs and 2) total deterioration cost. The proposed problem has been solved by a modified version of the original Nondominated Sorting Genetic Algorithm-II (NSGA-II) which is one of the commonly applied Multi-Objective Evolutionary Algorithm in the existing literature. NSGA-II has been modified by introducing a novel mutation algorithm that has been embedded in the original NSGA-II. The experimental results show the Pareto optimal solutions and conclusions are drawn based on the results.
机译:在本文中,提出了一种双目标作业测序问题。目标是 - 1)工作总加权迟到,2)总恶化成本。所提出的问题已经通过原始NondoMinated分类遗传算法-II(NSGA-II)的修改版本来解决,这是现有文献中的常用多目标进化算法之一。通过引入嵌入原始NSGA-II的新型突变算法来修改NSGA-II。实验结果表明Pareto最佳解决方案和结论是基于结果的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号