›› 2009, Vol. 11 ›› Issue (2): 157-162.

• ARTICLES • Previous Articles     Next Articles

Design of an Algorithm of Public Traffic Transfer Based on the Least Transfer

FAN Xiaochun1, ZHANG Xueying1, LIU Xuejun1, SHEN Qijun1, FAN Xiaoming2   

  1. 1. Key Laboratory of Virtual Geographical Environment,Nanjing Normal University,Ministry of Education,Nanjing 2100046,China;
    2. Changzhou Automation Research Institute of CCRI,Changzhou 213000,China
  • Received:2008-10-23 Revised:2009-01-17 Online:2009-04-25 Published:2009-04-25

Abstract: At present there are two significant problems in the field of intelligent transportation systems,i.e.algorithmic efficiency and transfer routines.First of all,this paper describes route selection behaviors of passengers and the characteristics of city traffic networks,and then presents the public traffic network-transit matrix based on key stops.Secondly,based on the shortest path algorithm,a public traffic network-transit matrix and a non-transfer matrix are introduced to design the public traffic transfer algorithm.In this algorithm,the public traffic network transit matrix aims to decide which temp label notes are potential label notes,and non-transfer notes are always considered as the notes of the shortest path,in order to improve the performance of classical shortest path algorithm(Dijkstra).Finally,a case is used to evaluate the performance of this algorithm.The experimental results indicate that the proposed algorithm achieves better efficiency than the Dijkstra.And much more reasonable transfer frequency is obtained.It is believed that this algorithm can be used in general transit networks,especially high transfer-cost networks.

Key words: key stops, public traffic network-transit matrix, public traffic transfer