一种竞争环境下基于自适应遗传算法的多边多议题协商

李剑; 景博; 杨义先

doi:10.3724/SP.J.1146.2008.00874

一种竞争环境下基于自适应遗传算法的多边多议题协商

doi: 10.3724/SP.J.1146.2008.00874

李剑^① 景博,,
景博,
杨义先

基金项目:

国家973计划项目(2007CB310704)和国家自然基金重点项目(90718001)资助课题

计量
- 文章访问数: 3870
- HTML全文浏览量: 77
- PDF下载量: 1526
- 被引次数: 0
出版历程
- 收稿日期: 2008-07-09
- 修回日期: 2008-09-10
- 刊出日期: 2008-11-19

An Adaptive Genetic Algorithm and Its Application to Multi-literal Multi-issue Competitive E-commerce

Li Jian^{① 景博
,},
Jing Bo,
Yang Yi-Xian

摘要

摘要: 为了提高竞争环境下基于智能体电子商务多边多议题协商当中agent协商的效率，该文提出了一种竞争环境下agent的协商模型，并且将自适应遗传算法AGA应用于该模型当中，来提高模型中agent协商的效率。在实验中，分别对于两种遗传算法即：标准遗传算法SGA和自适应遗传算法AGA各进行了1000次的实验。结果表明同样达到协商满意解的时候，SGA平均需要183次协商，而AGA平均需要152次协商。这个结果说明，在求解竞争环境下多边多议题协商问题的时候，自适应遗传算法AGA可以使得协商当中的agent高效达到协商的满意解。
- 电子商务 /
- 智能体 /
- 多边多议题协商 /
- 自适应遗传算法
Abstract: To make the agents negotiate more efficiently in multi-lateral multi-issue negotiation in multi-agent based competitive e-commerce, an agent negotiation model in competitive environment is presented, and the Adaptive Genetic Algorithm(AGA) is applied to the model to enhance the negotiation efficiency. In the experiments, two kinds of genetic algorithms are used to compare with, they are Standard Genetic Algorithm(SGA) and AGA. After 1000 times of experiments for the two kinds of agents to gain the satisfying result, SGA averagely needs negotiation of 183 runs, while the AGA averagely needs only 152 runs. The experiment results show that the AGA can gain the satisfying negotiation result more efficiently than SGA in competitive multi-lateral multi-issue negotiation.
- E /
- - /
- c

HTML全文

参考文献(1)

[1] 文静华, 李祥等. 基于ATL 的公平电子商务协议形式化分析[J].电子与信息学报.2007, 29(4):901-905浏览 [2] 彭志平, 彭宏, 郑启伦. 一种双边多议题自治协商模型的研究[J].电子与信息学报.2007, 29(3):733-738浏览 [3] Hyde E B and Michael J P. Getting to best: Efficiency versusoptimality in negotiation[J].Cognitive Science.2000, 24(2):169-204 [4] Kambil A, Kamis A, and Koufaris M. Electronic marketing[C]. Proceedings of the 36th Annual Hawaii InternationalConference on System Sciences. Hawaii, USA. 2003: 190. [5] Markus M L, Banerjee P, and Louis M. Electronicmarketplaces in Hong Kong's trading industry [C].Proceedings of the 35th Annual Hawaii InternationalConference on System Sciences (HICSS-2002). Hawaii, USA.2002: 2352-2361. [6] 梁茹冰. 基于资源的多agent 多议题协商模型研究与设计[J].华南金融电脑, 2006, (2): 56-58.Liang Ru-bing. Research and design of multi-agentmulti-issue negotiation model based on resource [J]. FinancialComputer of Huanan, 2006, (2): 56-58. [7] 王立春, 陈世福. 多Agent 多问题协商模型[J]. 软件学报,2004, 13(8): 1637-1643.Wang Li-chun, Chen Shi-fu. A multi-Agent multi-issuenegotiation model [J]. Journal of Software, 2004, 13(8):1637-1643. [8] Holland C P. Competition and strategy in electronicmarketplaces [C]. Proceedings of the 35th Annual HawaiiInternational Conference on System Sciences (HICSS-2002),Hawaii, USA. 2002: 2947-2956. [9] Faratin P, Sierra C, and Jennings N R. Using similaritycriteria to make 2 tradeoffs in automated negotiations [J].Artificial Intelligence.2002, 142(2):205-237 [10] Matthias R G. Fair-negotiation procedures [J]. MathematicalSocial Sciences, 2000, 39(3): 303-322. [11] Soo Von-wun and Hung Chun-an. On-line incrementallearning in bilateral multi-issue negotiation [C]. The firstInternational Joint Conference on Autonomous Agents andMulti-agent Systems. Bologna, Italy. 2002: 314-315. [12] 翁鸣, 梁俊斌, 苏德富. 基于遗传算法的多边多议题自动协商模型[J]. 计算机工程, 2005, 31(16): 154-156.Weng Ming, Liang Jun-bin, and Su De-fu. Many-to-manymulti-issue automated negotiation model based on geneticalgorithm [J]. Computer Engineering, 2005, 31(16): 154-156. [13] 寇华, 王宝树. 基于遗传算法的RBF-PLS 方法在辐射源识别中的应用[J].电子与信息学报.2007, 29(5):1031-1034浏览 [14] 邹谊, 魏文龙, 李斌, 等. 多目标量子编码遗传算法[J].电子与信息学报.2007, 29(11):2688-2692浏览 [15] 房磊, 张焕春, 经亚枝. 一种基于FPGA 的自适应遗传算法[J].电子与信息学报.2005, 27(11):1829-1833浏览

施引文献

资源附件(0)

访问统计