期刊文献+

最短路径在乡村私立小学选址中的应用——以内黄县白条河私立小学选址为例 被引量:1

Shortest Path in Location of Village Private Primary School——A Case Study of Baitiaohe
下载PDF
导出
摘要 地理信息系统以其强大的地理信息空间分析功能,对空间信息进行分析和处理,并在各种区域规划及选址项目中发挥着重要的作用。以内黄县白条河私立小学选址为例,运用最短路径选址方法,分析学校选址相关因素,综合考虑了人口的空间分布、周边学校现有数量、交通距离等,通过地理信息系统技术辅助进行了模拟分析,给出了学校选址的数学模型,通过实际模拟得出辐射区内的学生到学校的路径,制定出私立小学选址的最佳方案,最终确定办学位置。 Geographic Information System can analyze and process spatial information with its powerful GIS spatial analysis function , it also plays an increasingly important role in regional planning projects .This study takes allocation plan of the Baitiaohe private primary school as an example , and describes the data structure and algo-rithm for the shortest path issue , it focuses on the shortest path issue and solution algorithm with the shortest path school site location model , then combines with the actual data and works out the best plan for the location of the private primary school , finally determines the site to build the school .
出处 《洛阳师范学院学报》 2015年第4期92-95,共4页 Journal of Luoyang Normal University
基金 河南省高等学校哲学社会科学研究重大项目(2014-SZZD-16)
关键词 最短路径 选址 地理信息系统 私立小学 the shortest path the location geographic information system private school
  • 相关文献

参考文献3

二级参考文献13

  • 1Feng Shaojun, Choi L L.Assisted GPS and its impact on navigation in intelligent transportation systems[C]//IEEE 5th International Conference on Intelligent Transporta- tion Systems, 2002 : 926-931.
  • 2Chang V.Web service testing and usability for mobile learning[C]//Networking, International Conference on Sys-tems and International Conference on Mobile Communi- cations and learning Technologies,2006:221-227.
  • 3Karas I R, Atila U.A genetic algorithm approach for finding the shortest driving time on mobile devices[J]. Sci Res Essays,2011,6(2) :394-405.
  • 4Cooke K, Halsey E.The shortest route through a network with time dependent internodal transit times[J].Journal of Mathematical Analysis and Applications, 1966, 14: 493-498.
  • 5Dreyfus S.An appraisal of some shortest-path algorithms[J]. Operations Research, 1969,17(3) :395-412.
  • 6Dijkstra E.A note on two problems in connexion with graphs[J].Numerische Mathematik, 1959,1 : 269-271.
  • 7Skriver A J V,Andersen K A.A label correcting approach for solving bicriterion shortest path problems[J].Comput- ers and Operations Research, 2000,27: 507-524.
  • 8Traff J L.An experimental comparison of two distributed single-source shortest path algorithms[J].Parallel Comput- ing, 1995,21 : 1505-1532.
  • 9Jost G,Jin H,an Mey D,et al.Comparing the OpenMP, MPI and hybrid programming paradigms on an SMP cluster[C]//Proceedings of EWOMP,2003.
  • 10Smith L, Bull M.Development of mixed mode MPI/OpenMP applications[J].Scientific Programming,2001,9(2/3) :83-98.

共引文献2

同被引文献8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部