Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (3): 219-221.DOI: 10.3778/j.issn.1002-8331.2010.03.067

• 工程与应用 • Previous Articles     Next Articles

Public traffic self-determining inquiry based on optimum nonstop matrix

MOU Lian-ming   

  1. Key Lab of Numerical Simulation of Sichuan Province,Dept. of Math.,Neijiang Normal University,Neijiang,Sichuan 641112,China
  • Received:2008-08-14 Revised:2008-10-21 Online:2010-01-21 Published:2010-01-21
  • Contact: MOU Lian-ming

基于最优直达矩阵的公交自主查询

牟廉明   

  1. 内江师范学院数学系 四川省高等学校数值仿真重点实验室,四川 内江 641112
  • 通讯作者: 牟廉明

Abstract: Firstly,in allusion to shortage in the public traffic system,the design method of optimum nonstop matrix is brought forward after the self-determining inquiry of public traffic is analyzed detailedly.Secondly,the transfer operator is designed and the judgment method of optimum aim is given.Thirdly,because nonstop matrix is the typical sparse-matrix,the efficient transfer arithmetic is designed after the large-scale nonstop matrix is transformed to the cross chain-list and the matrix transfer operation is transformed to the intersection operation of chain-list.Lastly,the validity of arithmetic is testified by an instance.Public traffic self-determining inquiry is effectively solved.

摘要: 针对目前公交查询系统存在的不足,分析了公交查询的自主性,给出了最优直达矩阵的构造方法;设计了换乘算子并给出最优目标判断方法;利用直达矩阵是一个典型的稀疏矩阵,将大型直达矩阵转化为十字链表,将矩阵的换乘运算转化为链表的交集运算,设计了高效的换乘算法;最后应用实例验证了算法的有效性,全面有效地解决了公交自主查询问题。

CLC Number: