Institutional Repository
| a hypervolume based approach for minimal visual coverage shortest path | |
| Li Jie; Zheng Changwen; Hu Xiaohui | |
| 2011 | |
| Conference Name | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
| Source | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
| Pages | 1777-1784 |
| Conference Date | 5-Jun-20 |
| Conference Place | New Orleans, LA, United states |
| Indexed Type | EI |
| Publish Place | United States |
| ISBN | 9781424478347 |
| Department | (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 |
| English Abstract | 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. |
| Keyword | Approximation Algorithms Mathematical Operators |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14381 |
| Collection | 天基综合信息系统全国重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a hypervolume based （350KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment