一种基于游客选择景点的旅游拼团算法  

A Tourism Grouping Algorithm Based on Tourists’Choice of Scenic Spots

作　　者：梁弼 赵文辉 杨斌 许晓红 LIANG Bi;ZHAO Wenhui;YANG Bin;XU Xiaohong(School of Intelligent Manufacturing,Sichuan University of Arts and Science,Dazhou 635000,China)

机构地区：[1]四川文理学院,智能制造学院,四川达州635000

出　　处：《微型电脑应用》2022年第11期18-21,共4页Microcomputer Applications

基　　金：四川旅游发展研究中心项目(LY20-44);四川革命老区发展研究中心项目(SLQ2019B-15);四川文理学院博士专项科研基金项目(2019BS006Z);四川文理学院大学生科研项目(X2020Z043)。

摘　　要：随着我国旅游业快速发展,越来越多的人喜欢外出旅游,游客拼团出行中存在个性化需求不一样,因此将拼团问题模型化,提出一种匹配游客需求特征的旅游拼团算法TGA(tourism grouping algorithm)。通过该算法筛选出最佳的拼团组合方案,进而为游客推荐优选的拼团组合及对象。实验结果表明,所提出的TGA算法能根据游客的个性化需求特征进行合理拼团,而且随着拼团信息数量的增加,拼团成功率也随之增加。With the rapid development of China’s tourism industry,more and more people like to travel,and group tours become popular.In view of the different personalized needs of different tourists for group travel,this paper models the grouping problem and proposes a tourism grouping algorithm(TGA)which matches the demand characteristics of tourists.Through the TGA,the best grouping scheme is selected,and the optimal group and objects are recommended for tourists.The experimental results show that the TGA proposed in this paper can effectively make reasonable grouping according to tourists’personalized demand characteristics,and the grouping success rate also increases with the increase of the number of grouping information.

关 键 词：旅游拼团 最大匹配算法 需求特征 相似度计算 成功率 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]