a hypervolume based approach for minimal visual coverage shortest path

	a hypervolume based approach for minimal visual coverage shortest path
	Li Jie ; Zheng Changwen ; Hu Xiaohui
	2011
会议名称	2011 IEEE Congress of Evolutionary Computation, CEC 2011
会议日期	5-Jun-20
会议地点	New Orleans, LA, United states
关键词	Approximation algorithms Mathematical operators
页码	1777-1784
英文摘要	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. © 2011 IEEE.
收录类别	EI
会议录	2011 IEEE Congress of Evolutionary Computation, CEC 2011
会议录出版地	United States
ISBN号	9781424478347
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/14381]
专题	软件研究所_综合信息系统技术国家级重点实验室 _会议论文
推荐引用方式 GB/T 7714	Li Jie,Zheng Changwen,Hu Xiaohui. a hypervolume based approach for minimal visual coverage shortest path[C]. 见:2011 IEEE Congress of Evolutionary Computation, CEC 2011. New Orleans, LA, United states. 5-Jun-20.