摘要： 为谈判问题建立便于遗传算法处理的数学模型,利用遗传算法的全局收敛性快速寻优,可并行性寻优以及模拟自然进化过程解决最优问题等优点,引入新的局部元启发搜索机制,加速搜索速度,提高搜索效率,克服传统遗传算法在处理永远难忘该类问题时出现的过早收敛,解缺乏多样性等缺陷,以便于在合理时间内产生协调解。最后,举例说明了该方法的可行性和特殊的优越性。

关键词: 网上谈判支持系统, 元启发, 遗传局部搜索

Abstract: This paper constructs a multi object combination optimization model that can be handled easily by genetic algorithm for the negotiation problem,and then,considering the global convergence,concurrency features,is uses a new genetic algorithm that hybridizes local meta heuristic mechanism to speed the search process,improves the efficiency and overcomes shortcomings such as the premature and lacking of diversity etc.Finally,the paper gives an example to demonstrate that the proposed method is feasible and efficient.

中图分类号: 

• TP18