Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (2): 1-4.doi: 10.13190/jbupt.200902.1.lij

• Papers •     Next Articles

A Bilateral Multi-Issue Negotiation Based on Hybrid Genetic Algorithm

LI Jian   

  • Received:2008-09-18 Revised:1900-01-01 Online:2009-04-28 Published:2009-04-28
  • Contact: LI Jian

Abstract:

To make the agents negotiate more efficient in bilateral multi-issue negotiation in multi-agent based e-commerce, an agent negotiation model is presented,。A hybrid genetic algorithm (HGA) is applied in the model to enhance the negotiation efficiency. Experiments are done for 1000 times for four kinds of agents to gain the satisfying result, Standard Genetic Algorithm(SGA) averagely needs 218 runs negotiation , Genetic Algorithm based on Metropolis rule(MGA) averagely needs 184 runs, adaptive genetic algorithm(AGA)averagely needs 152 runs while the hybrid genetic algorithm(HGA) averagely 121 runs. Experimentals show that the HGA can gain the optimal negotiation result more efficiently than other three kinds of genetic algorithms in bilateral multi-issue negotiation.

Key words: e-commerce, bilateral multi-issue negotiation, hybrid genetic algorithm, agent