期刊文献+

粗交流结果最优传递序列的模拟退火算法 被引量:2

Simulated Annealing Algorithm for Result Optimal Translation Sequence in Rough Communication
下载PDF
导出
摘要 粗交流中,确定概念在多个agents间传递时,由于各个agent有不同的语言,相互之间不能提供准确的信息交流,从而导致概念在传递过程中会丢失部分信息,最后得到粗糙的结果。在不同的粗交流传递序列中,信息的丢失量往往是不同的。利用模拟退火算法,得到使参与粗交流的最后一个agent获得信息量最大的粗交流传递序列。算法的分析和仿真验证了该方法的有效性。 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.
出处 《模糊系统与数学》 CSCD 北大核心 2006年第5期125-130,共6页 Fuzzy Systems and Mathematics
基金 山东省教育厅科研发展计划项目(J06P01) 山东省自然科学基金资助项目(Y2004A04) 福建省教育厅资助项目(JA05326)
关键词 粗集 粗交流 传递序列 结果最优 模拟退火 Rough Sets Rough Communication Translation Sequence Result Optimal Simulated Annealing
  • 相关文献

参考文献12

二级参考文献24

  • 1杨若黎,顾基发.一种高效的模拟退火全局优化算法[J].系统工程理论与实践,1997,17(5):29-35. 被引量:101
  • 2GAREY M R, JOHNSON D S, SETHI R. The complexity of flow shop and job shop scheduling [J ]. Mathematics of Operations Research, 1976, 1 (2) : 117 - 129. 被引量:1
  • 3LENSTRA J K, RINNOOY Kan AHG, BRUCKER P. Complexity of machine scheduling problems [ J ]. Annal of Discrete Mathematics,1977,1(1):343-362. 被引量:1
  • 4CAMPBELL H G, DUDEK R A, SMITH M L. A heuristic algorithm for the n-jobs, m-machine sequencing problem [ J]. Management Science, 1970,( 16):630-637. 被引量:1
  • 5NAWAZ M, EMSCORE Jr E E, HAM I. A heuristic algorithm for the n-job, m-machine flow shop sequencing problems [J]. Int J of Management Science, 1983, (11 ):91 - 98. 被引量:1
  • 6TAILLARD E.Some efficient heuristic methods for the flow shop seqencing problem [ J ]. European J of Operational Research, 1990,(47) : 65 - 74. 被引量:1
  • 7OSMAN I H, POTTS C N. Simulated annealing for permulation flow shop scheduling [ J]. Int J of Managemera Science, 1989, (17) :551 -557. 被引量:1
  • 8KIRKPATRICK S, GELATT C D Jr, VECCHI M P. Optimization by simulated annealing [J]. Science, 1983, (220) :671 - 680. 被引量:1
  • 9GRABOWSKI J, SKUBALSKA E, SMUTNICKI C. On flow shop scheduling with release and due dates to minimize maximum lateness[ J]. J of Operational Research Society, 1983, (4) :615 - 620. 被引量:1
  • 10GRABOWSKI J, NOWICKI E, ZDRALKA S. A block approach for single-machine scheduling with release dates and due dates .European J of Operational Research, 1986, (26) :278 - 285. 被引量:1

共引文献101

同被引文献18

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部