Adaptive Genetic Algorithm and Its Application in Multi-Lateral Multi-Issue Negotiation
Bo Jing · Beijing Youdian Xueyuan xuebao · 2008
To make the negotiation agents gain optimal result and more efficiently to negotiate in multi-agent based e-commerce,an adaptive genetic algorithm is presented and applied in multi-lateral multi-issue simultaneous bidding negotiations. 1?000 times of experiments show that,for satisfying results,the adaptive genetic algorithm averagely needs 210 times run with contrast to 187 times run of the standard genetic algorithm.So it also shows that the adaptive genetic algorithm can gain the optimal negotiation result more efficiently in multi-literal multi-issue negotiation.