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
会议录名称	2011 IEEE Congress of Evolutionary Computation, CEC 2011
页码	1777-1784
会议日期	5-Jun-20
会议地点	New Orleans, LA, United states
收录类别	EI
出版地	United States
ISBN	9781424478347
部门归属	(1) Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, China; (2) National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences, Beijing, China
摘要	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.
关键词	Approximation Algorithms Mathematical Operators
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/14381
专题	天基综合信息系统全国重点实验室
推荐引用方式 GB/T 7714	Li Jie,Zheng Changwen,Hu Xiaohui. a hypervolume based approach for minimal visual coverage shortest path[C]. United States,2011:1777-1784.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
a hypervolume based （350KB）			开放获取	--	请求全文