互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

面向旅游行程规划的交互式多智能体遗传算法陆 青 梁昌勇 黄永青 张俊岭


   (1.合肥工业大学 计算机网络系统研究所, 合肥 230009; 2.铜陵学院 计算机系, 安徽 铜陵 244000)

  

  摘要:结合多智能体技术和交互式遗传算法,提出了一种面向旅游行程规划问题的交互式多智能体遗传算法。算法通过让固定在网格上的智能体展开进化和竞争行为来寻找满意行程。在算法每代中,用户只需评价选择一个当代最优智能体,就可计算得到当代所有智能体的能量,减少了评价次数,有效缓解了用户在评价过程中的疲劳问题。仿真实验验证了该算法在解决旅游行程规划问题中的可行性和有效性,并对问题规模表现出很好的可伸缩性。

  关键词:交互式遗传算法; 多智能体; 用户疲劳; 旅游行程规划

  中图分类号:TP18; TP301.6文献标志码:A

  文章编号:1001-3695(2008)11-3311-03

  

  Interactive multi-agent genetic algorithm for travel itinerary planning

  

  LU Qing1, LIANG Chang-yong1, HUANG Yong-qing2, ZHANG Jun-ling1

  

  (1.Institute of Computer Network, Hefei University of Technology, Hefei 230009, China; 2. Dept. of Computer, Tongling University, Tongling Anhui 244000, China)

  

  Abstract:The paper proposed an interactive multi-agent genetic algorithm for the travel itinerary planning problem, which combined the multi-agent technology with the interactive genetic algorithm. The algorithm made agents fixed on a lattice evolve and compete in order to search the satisfactory itinerary. In every generation, a user only needed to evaluate and find out an agent which was the current best one, and then energies of all agents in this generation could be calculated automatically, which reduced the user’s evaluations and contributes to relieve the human fatigue in the evaluation process. The simulation experiment shows that the algorithm is a feasible and effective method for the travel itinerary planning problem, and has good scalability for the problem’s size.

......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017