摘要
为解决游客出行时选取最短旅行线路的困扰,在导游系统中加入了路径分析的功能。将分支限界算法应用于最短路径分析中,通过获取不同景点的ID号以及地理位置找到一条通过每个景点且只通过一次的最短旅行路线,通过仿真,其结果达到了预期的目标。
In order to solve the problem that tourists select the shortest route when travelling, path analysis function is added in tour guide system. The branch and bound algorithm is applied to the shortest path analysis, finding the shortest route along which each spot is passed and only once through access to ID number and location of different spots. Through the simulation, the result has achieved the anticipated target.
出处
《信息技术》
2013年第4期147-150,共4页
Information Technology
关键词
最短路径
限界函数
分支限界算法
the shortest path
bounding function
branch and bound algorithm
