基于时间框架的多日游行程规划及其优化方法  

Multi-day tourist trip design and its optimization method based on time framework

作　　者：张久滕 吴小竹[1] 陈崇成[1] 方荟 刘先锋[3] 方东 ZHANG Jiuteng;WU Xiaozhu;CHEN Chongchen;FANG Hui;LIU Xianfeng;FANG Dong(Key Laboratory of Spatial Data Mining and Information Sharing of Ministry of Education,Spatial Information Research Centre of Fujian Province,Fuzhou University,Fuzhou,Fujian 350116,China;Department of Computer Science,Minjiang University,Fuzhou,Fujian 350108,China;Fuzhou Silviscene Information Technology Co.Ltd.,Fuzhou,Fujian 350117,China)

机构地区：[1]福州大学福建省空间信息工程研究中心,空间数据挖掘与信息共享教育部重点实验室,福建福州350116 [2]闽江学院计算机科学系,福建福州350108 [3]福州林景行信息技术有限公司,福建福州350117

出　　处：《福州大学学报（自然科学版）》2018年第6期787-793,共7页Journal of Fuzhou University(Natural Science Edition)

基　　金：国家重点研发计划课题(2017YFB0504202);福建省科技计划重点资助项目(2015H0015);福建省科技型中小企业创新基金资助项目(2015C0042).

摘　　要：针对个性化旅游特别是自驾游的实际需求,研究基于多个约束条件的旅游行程规划问题.提出一个旅游行程规划算法,以时间框架为基础,遗传算法为核心,通过对有效旅游路线的不断优化,输出其中一条最优的旅游路线.最后,在真实数据集上进行实验,将提出的算法与变邻域搜索算法进行比较,对路线的总评分值结果进行评价.结果表明,研究提出的算法能够获得更高的路线评分值,能够为旅行者提供准确合理的旅游路线.Aiming at the actual needs of the personalized traveling,especially self-driving traveling,in this paper,we study tourist trip design problem based on multiple constraints.In order to solve this problem,a tourist trip design algorithm is adopted,the algorithm is based on multi-day time framework,take the genetic algorithm as the core,through the continuous optimization of the valid route,and returned to an optimal travel route eventually.Finally,use this paper proposed tourist trip design algorithm compared with variable neighborhood search(VNS)algorithm in order to evaluate the quality of the route results.The result show that our algorithm can obtain higher score values and provide an accurate and reasonable travel route for all travelers.

关 键 词：旅游行程规划问题 遗传算法 时间框架 自驾游 兴趣点 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]