校园观光车最优路径规划算法研究——以韶关学院为例

Campus Sightseeing Car Optimal Path Planning Algorithm Taking Shaoguan University as an Example

复杂校园路网下的最优路径计算,直接影响校车站点设置、线路设置等。以韶关学院校园观光车的行车路线为研究对象,利用迪克斯查标号法(Dijkstra)最短路径算法为基础,采用地理信息系统(GIS)空间网络分析方法,根据校园师生问卷调查的结果确定站点,是建立最优路径规划算法的前提条件,从起点和终点,再根据连接的中间站点,计算韶关学院各乘车站点之间的最优路径的整体路径规划方案。结合韶关学院的实际情况,提出校园观光车最优路径方案规划算法、站点和路径。以便提高校园观光车的利用率,减少资源的占用和浪费,既保证了校园师生的安全,也节省了广大师生的时间以及获取教育资源的便捷程度,降低校园能耗,为创建节约型校园做出贡献。

Calculation of optimal paths under a complex campus networks,directly affecting school bus site settings,line sets,and so on.To Shaoguan College campus sightseeing car of lane route for research object,uses di grams Republican check label law（Dijkstra） shortest path algorithm for based,used geographic information systems（GIS） space network analysis method,according to campus teachers and students questionnaire investigation of results determines site,is established optimal path planning algorithm of premise conditions,from starting point and end,again according to connection of middle site,calculation Shaoguan College the ride site Zhijian of optimal path of overall path planning programme.Combined with realities of Shaoguan University,raised campus tour bus algorithm for optimal path programming,site,and path.In order to improve utilization of tourist cars on campus,reduce resource consumption and waste,both to ensure the safety of teachers and students on campus at the same time,also saves the majority of teachers and students of the time as well as ease of access to educational resources,reduce energy consumption on campus,to create and contribute to resource-saving campus.