首页> 外文会议>2011 IEEE Congress on Evolutionary Computation >A hypervolume based approach for minimal visual coverage shortest path
【24h】

A hypervolume based approach for minimal visual coverage shortest path

机译:基于超量的方法,以最小的可视范围,最短路径

获取原文

摘要

In this paper, the minimal visual coverage shortest path in raster terrain is studied with the proposal of a hypervolume contribution based multiobjective evolutionary approach. The main feature of the presented method is that all individuals in the population are periodically replaced by the selected non-dominated candidates in the archive based on hypervolume contribution, besides the well designed evolutionary operators and some popular techniques such as dominated relation and archive. Our algorithm may obtain well distributed Pareto set approximation efficiently, which is superior to the implementations based on the framework of NSGA-II and SMS-EMOA with respect to the hypervolume.
机译:提出了一种基于超体积贡献的多目标进化方法,研究了栅格地形中最小视觉覆盖最短路径。提出的方法的主要特征是,除了精心设计的进化算子和一些流行的技术(如支配关系和档案)以外,基于超大量贡献,人口中的所有个人都将定期被档案中选定的非支配候选人替换。我们的算法可以有效地获得分布良好的帕累托集近似值,这在超容量方面优于基于NSGA-II和SMS-EMOA框架的实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号