| 粗交流结果最优传递序列的模拟退火算法 |
| |
| 引用本文： | 王洪凯,陈秀琼,史开泉. 粗交流结果最优传递序列的模拟退火算法[J]. 模糊系统与数学, 2006, 20(5): 125-130 |
| |
| 作者姓名： | 王洪凯 陈秀琼 史开泉 |
| |
| 作者单位： | 济南大学,理学院,山东,济南,250022;山东大学,数学与系统科学学院,山东,济南,250100;三明学院,数学与计算机系,福建,三明,365004;山东大学,数学与系统科学学院,山东,济南,250100 |
| |
| 基金项目： | 山东省教育厅科研发展计划项目(J06P01)，山东省自然科学基金资助项目(Y2004A04)，福建省教育厅资助项目(JA05326) |
| |
| 摘 要： | 粗交流中,确定概念在多个agents间传递时,由于各个agent有不同的语言,相互之间不能提供准确的信息交流,从而导致概念在传递过程中会丢失部分信息,最后得到粗糙的结果。在不同的粗交流传递序列中,信息的丢失量往往是不同的。利用模拟退火算法,得到使参与粗交流的最后一个agent获得信息量最大的粗交流传递序列。算法的分析和仿真验证了该方法的有效性。
|
| 关 键 词： | 粗集 粗交流 传递序列 结果最优 模拟退火 |
| 文章编号： | 1001-7402（2006）05-0125-06 |
| 收稿时间： | 2005-06-24 |
| 修稿时间： | 2005-06-24 |
Simulated Annealing Algorithm for Result Optimal Translation Sequence in Rough Communication |
| |
| WANG Hong-kai,CHEN Xiu-qiong,SHI Kai-quan. Simulated Annealing Algorithm for Result Optimal Translation Sequence in Rough Communication[J]. Fuzzy Systems and Mathematics, 2006, 20(5): 125-130 |
| |
| Authors: | WANG Hong-kai CHEN Xiu-qiong SHI Kai-quan |
| |
| Affiliation: | 1. School of Seienee,Jinan University,Jinan 250022,China; 2. School of Mathematics and System Sciences, Shandong University, Jinan 250100,China ; 3. Department of Mathematics and Computer, Sanming College, Sanming 365004,China |
| |
| Abstract: | In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. In order to get the translation sequence, in which the last agent taking part in rough communication gets maximum information, simulated annealing algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach. |
| |
| Keywords: | Rough Sets Rough Communication Translation Sequence Result Optimal Simulated Annealing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
