首页> 外文会议>International Conference on Mathematics, Modelling, Simulation and Algorithms >Tourism Route Plan Algorithm Based on Sight Spot Buffer Motive Iteration
【24h】

Tourism Route Plan Algorithm Based on Sight Spot Buffer Motive Iteration

机译:基于视野缓冲器动力迭代的旅游路线规划算法

获取原文

摘要

Currently, tourism plan cannot fully consider tourists' individual interests. And routes planned cannot meet tourists' best motive benefits. As to the problems, this paper brings forward tourism route plan algorithm basing on sight spot buffer motive iteration. Firstly, sight spot buffer model is set up and sight attracting factors and indexes are confirmed, on which basis, sight spot interval iteration model is set up. Through test example, optimal and suboptimal tourism routes which meet individual interests and best motive benefits are obtained. Example proves that this algorithm model can fully consider tourists' interests and output tourism routes to meet tourists' motive benefits, which is feasible and practical.
机译:目前,旅游计划无法充分考虑游客的个人兴趣。计划的路线不能满足游客的最佳动力福利。关于问题,本文提出了基于视野缓冲器迭代的旅游路线规划算法。首先,设置了视距缓冲模型,并确认了视力吸引因素和索引,在此设置了视图点间隔迭代模型。通过测试示例,获得满足个人兴趣和最佳动力效益的最佳和次优的旅游路线。示例证明,该算法模型可以充分考虑游客的兴趣和产出旅游路线,以满足游客的动力益处,这是可行和实用的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号