期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

电子商务中基于遗传算法的多Agent自动协商 被引量：3

Genetic Algorithm Needed for Automated Negotiations among Multi-agents in Electronic Commerce Environment
下载PDF
导出
摘要 讨论了现有的多Agent协商技术,提出了一个基于遗传算法的多边多议题自动协商模型,并且给出了相应算法,该算法在评价函数、种群编码策略、交叉和变异操作等方面都对传统遗传算法进行了改进。实验表明:该算法能够迅速求出协商解,且Agent能保持较高的效用,具有一定的通用性。 In this paper,current techniques of negotiation are discussed,a new many-to-many multi-issue automated negotiation model is proposed and the associated negotiation algorithms is provided.The algori-thm adopted real coding,adjusted fitness function,improved cross and variation operation.The model can solve problems rapidly and keep the utility of agents in a high level.
作者 朱冬梅 盛建瓴 杜杏菁
机构地区 华北科技学院计算机系
出处 《煤炭技术》 CAS 北大核心 2011年第4期215-216,共2页 Coal Technology
关键词 多AGENT 自动协商 遗传算法 multi agent automated negotiation genetic algorithm
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献6

  • 1Park S,Yang S B.An efficient multilateral negotiation system for pervasive computing environments[J].Engneering Applications of Artificial Intelligence,2008,21(4):633-643.
  • 2Rosenschein J S,Zlotkin.Rules of encounter:Design conventions for automated egotiation among computers[M].Cambridge A:MIT Press,1994.
  • 3Amgoud L,Prade H.Formal handling of threats and rewards in a negotiation dialogue[C].New York,NY,USA:ACM Press,2005:529-536.
  • 4S?Shadrokh,F?Kianfar?A genetic algorithm for resource investment project scheduling problem,tardiness permitted with penalty[J].European Journal of Operational Research,2007,181:86-101.
  • 5刘琨.基于GA求解制造过程调度问题[J].煤炭技术,2010,29(2):218-220. 被引量：1
  • 6翁鸣,梁俊斌,苏德富.基于遗传算法的多边多议题自动协商模型[J].计算机工程,2005,31(16):154-156. 被引量：6

二级参考文献13

  • 1S. Shadrokh, F. Kianfar. A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty [J]. European Journal of Operational Research, 2007, 181: 86- 101.
  • 2U. Bilge, M. Kurtulan, F. K? rac. A tabu search algorithm for the single machine total weighted tardiness problem [J]. European Journal of Operational Research, 2007, 176:1423 - 1435.
  • 3C. Rajendran, H. Ziegler. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs []]. European Journal of Opemtional Research, 2004, 155: 426- 38,.
  • 4C, J Liao, C. T. Tsengb, P. Luamb. A discrete version of particle swarm optimization for flowshop scheduling problems [J]. Computers and Operations Research, 2007. 34:3099 - 3111.
  • 5A. C. Nearchou. A differential evolution approach for the common due date early/tardy job scheduling problem [J]. Computers and Operations Research, 2008, 35:1329 - 1343.
  • 6D. A. Koonca, S. C. Tsai. Use data mining to find patterns in genetic algorithm solutions to a job shop schedule [J]. Computers and Industrial Engineering, 2000, 38: 361- 374.
  • 7J. G. Dai, G. Weiss. A fluid heuristic for minimizing makespan in job shops [J]. Operations Research, 2002, 50(4): 692-707.
  • 8D. P. Song, C. Hicks, C. F. Earl. An ordinal optimization based evolutionary strategy to schedule complex make - to - older products [J]. International Journal of Production Research, 2006, 22: 4877- 4895.
  • 9Faratin P. Automated Service Negotiation Between Autonomous Computational Agents[Ph.D. Thesis]. http://www.ana.lcs.mit.edu/ peyman/pubs/peyman-thesis.pdf, 2000
  • 10Nagel R N, Dove R. The 21st Century Manufacturing Enterprise Strategy Report. An Industry-led View, Iacoca Institute, Leihigh University, 1991

共引文献5

同被引文献18

引证文献3

二级引证文献2

煤炭技术
2011年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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