一种多约束指标改进的动态旅游路线规划算法  

An Improved Dynamic Travel Route Planning Algorithm Based on Multiple Constraints

作　　者：周啸[1,2] 李胜辉 高奎亮 刘成龙 王含巢 胡家玮 ZHOU Xiao;LI Sheng-hui;GAO Kui-liang;LIU Cheng-long;WANG Han-chao;HU Jia-wei(Basic Department,Information Engineering University,Zhengzhou 450001,China;Institute of Information Engineering,Henan Mechanical and Electrical Vocational College,Zhengzhou 451191,China;Institute of Data and Target Engineering,Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学基础部,河南郑州450001 [2]河南机电职业学院信息工程学院,河南郑州451191 [3]信息工程大学数据与目标工程学院,河南郑州450001

出　　处：《中北大学学报（自然科学版）》2019年第1期57-62,69,共7页Journal of North University of China(Natural Science Edition)

基　　金：国家自然科学基金资助项目(41571399;41501446;41771487)

摘　　要：针对目前旅游路线规划缺乏自主性,难以满足旅游者个性化需求的问题,提出了一种多约束指标改进的动态旅游路线规划算法.首先建立了兴趣景点集模型和特征拐点集模型,确定多约束指标,以最短路径规划为基础融合多约束指标设计动态旅游路线规划算法,使旅游者能够在自主或利用智能机随机选取景点后智能规划最优旅游路线.算例证明,该算法能够输出距离最短同时符合旅行摆渡过程一般规律的路线,满足旅游者个性化需求,使旅游者获得最佳动机利益满足.Aiming at the problems of low autonomy on travel route planning and difficulty in meeting individual needs of tourists,this paper brings forward an improved dynamic travel route planning algorithm based on multiple constraints.Firstly,interest sight spot set model and feature inflection point set model are set up,then multiple constraints are confirmed.Based on the shortest path planning,dynamic travel route planning algorithm is designed mixed with the multiple constraints,which can intelligently plan travel route after tourists choose sight spots autonomously or intelligent machine chooses sight spots automatically.Example simulation testifies that this algorithm can plan and output the shortest travel route which corresponds to travel transfer rule,which can meet the individual needs of tourists and help tourists to get the best motive benefits.

关 键 词：多约束指标 动态规划 旅游路线 动机利益 

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