首页 | 本学科首页   官方微博 | 高级检索  
     

基于排序的非劣集合快速求解算法
引用本文:曾三友,李晖,丁立新,姚书振,许中华.基于排序的非劣集合快速求解算法[J].计算机研究与发展,2004,41(9):1565-1571.
作者姓名:曾三友  李晖  丁立新  姚书振  许中华
作者单位:1. 株洲工学院计算机科学与技术系,株洲,412008;中国地质大学计算机科学与技术系,武汉,430074
2. 中国地质大学计算机科学与技术系,武汉,430074
3. 武汉大学软件工程国家重点实验室,武汉,430072
4. 株洲工学院计算机科学与技术系,株洲,412008
基金项目:国家自然科学基金项目 (60 0 73 0 43 ,70 0 710 42,60 13 3 0 10 ,60 2 0 40 0 1),武汉青年科技晨光计划基金项目(2 0 0 2 5 0 0 10 0 2 ),湖南省教育厅资助科研基金项目 (0 2C64 0 )
摘    要:提出一种快速算法求解非劣集合,它采用两种技术加速求解:①它不直接求原集合的非劣集合而是转化成求一个整型集合的非劣集合;②它制定一个总体上非劣元素在前、劣元素在后的检查序列,并以尽可能少的比较次数检查一个元素的非劣性,一旦发现后面的元素全劣,终止搜索.理论和实验结果表明,当非劣集合较大时新算法的性能明显优于当前所知的较快算法(KLP).

关 键 词:非劣集合  偏序关系  多目标优化  多目标进化算法

A Fast Algorithm for Finding Non-Dominated Set Based on Sorting
ZENG San You ,LI Hui ,DING Li Xin ,YAO Shu Zhen ,and XU Zhong Hua.A Fast Algorithm for Finding Non-Dominated Set Based on Sorting[J].Journal of Computer Research and Development,2004,41(9):1565-1571.
Authors:ZENG San You    LI Hui  DING Li Xin  YAO Shu Zhen  and XU Zhong Hua
Affiliation:ZENG San You 1,2,LI Hui 2,DING Li Xin 3,YAO Shu Zhen 2,and XU Zhong Hua 1 1
Abstract:An efficient approach is proposed to find a non dominated set Two techniques are employed to speed up the search for non dominated set One of them is that the search for a non dominated set is from an integer set corresponding to the original set, instead of the original set The other is that the likely non dominated elements stay at the front in the check sequence, and the non dominance is checked with as few comparisons as possible, and once the rest check sequence is dominated, the search is stopped Theoretical analysis and experimental results show that the new approach performs much better than other approaches when the original set has a larger non dominated set
Keywords:non-dominated set  partial ordered relation  multi-objective optimization  multi-objective evolutionary algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号