【24h】

NON-DOMINATED SORTING GENETIC QUANTUM ALGORITHM FOR MULTI-OBJECTIVE OPTIMIZATION

机译:多目标优化的非排序排序遗传量子算法

获取原文

摘要

This paper presents a new multi-objective optimization method, which is inspired from the idea of non-dominated sorting genetic algorithm (NSGA) and genetic quantum algorithm (GQA). The GQA has been tested on well known test beds in single objective optimization and compared with the genetic algorithm (GA) in the lead author's previous work [22]. This paper aims to apply the idea of GQA to multi-objective optimization (MOO). The developed method is called non-dominated sorting genetic quantum algorithm (NSGQA). The developed method is tested with benchmark problems collected from literature, which have characteristics representing various aspects of a MOO problem. Test results show that NSGQA has better performance on most benchmark problems than currently popular MOO methods such as the NSGA. The integration of GQA with MOO, and the systematic comparison with other MOO methods on benchmark problems, should be of general interest to researchers on MOO and to practitioners using MOO methods in design.
机译:本文提出了一种新的多目标优化方法,该方法受到非支配排序遗传算法(NSGA)和遗传量子算法(GQA)的启发。 GQA已在单目标优化中的众所周知的测试台上进行了测试,并与主要作者先前的工作中的遗传算法(GA)进行了比较[22]。本文旨在将GQA的思想应用于多目标优化(MOO)。所开发的方法称为非支配排序遗传量子算法(NSGQA)。使用从文献中收集的基准问题对开发的方法进行了测试,这些基准问题具有代表MOO问题各个方面的特征。测试结果表明,NSGQA在大多数基准问题上的性能要优于当前流行的MOO方法(例如NSGA)。 GQA与MOO的集成,以及与其他MOO方法在基准问题上的系统比较,应该是MOO研究人员和在设计中使用MOO方法的从业人员普遍感兴趣的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号