首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于公共交通乘车查询系统的数学模型及实现方法
引用本文:郑琼琼,余冬菊,苏玉萍,闫硕,李冰.基于公共交通乘车查询系统的数学模型及实现方法[J].山西电子技术,2008(3):47-48.
作者姓名:郑琼琼  余冬菊  苏玉萍  闫硕  李冰
作者单位:河南师范大学计算机与信息技术学院,河南新乡453007
摘    要:根据北京公交站点分布情况,建立了解决公交拥挤的数学模型,并通过算法和程序化运算,解决了任意两站点间最佳线路的查询问题。在邻接矩阵相乘的过程中,剔除了与现实生活中不相符合的数据,对邻接矩阵中的行和列进行了选择,同时假设出公汽交通阻抗值,从而有效地降低了算法复杂度,并通过对深度优先遍历递归算法的进一步优化再次降低了算法的复杂度。

关 键 词:邻接矩阵  深度优先遍历递归算法  线路优化  交通阻抗值

The Mathematical Model of Inquiry System Based on Public Transportation and the Realization Method of It
Zheng Qiong-qiong Yu Dong-ju Su Yu-ping Yan Shuo Li Bing.The Mathematical Model of Inquiry System Based on Public Transportation and the Realization Method of It[J].Shanxi Electronic Technology,2008(3):47-48.
Authors:Zheng Qiong-qiong Yu Dong-ju Su Yu-ping Yan Shuo Li Bing
Institution:Zheng Qiong-qiong Yu Dong-ju Su Yu-ping Yan Shuo Li Bing (Department of Computer Science,Henan Normal University,Henan Xinxiang 453007,China)
Abstract:According to the distribution of Beijing bus sites,the thesis builds a mathematic model in order to solve the crowded transportation,and it also solves the enquiry problem of the best route between any two sites according to the algorithm and the programmed operation.In the process of adjacency matrix multiplication,it ignores the data which are not incompatible with the reality of life,chooses the rows and columns of the adjacency matrix and supposes the values of bus impedance,thus the complexity of the a...
Keywords:adjacency matrix  depth-first search algorithm  line optimization  traffic impedance values  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号