Paper Title:
Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix
  Abstract

This paper introduces the Adjacency Matrix at the very beginning, the least transfer between two nodes can be obtained by using the Adjacency Matrix, and then Z matrix is introduced to achieve optimal routing algorithm for public transit transfer and to obtain optimal route by using the “two-step-descending-proliferation” algorithm. Through the "two-step" approach, efficiency and feasibility of data processing was increased. The algorithm focus on multi-objective optimization - takes the least transfer, the least cost, the shortest time, and so on.

  Info
Periodical
Edited by
Zhu Zhilin & Patrick Wang
Pages
341-346
DOI
10.4028/www.scientific.net/AMM.40-41.341
Citation
C. X. Zhang, L. L. Zhuang, X. D. Wang, H. W. Rong, "Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix", Applied Mechanics and Materials, Vols. 40-41, pp. 341-346, 2011
Online since
November 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Jing Hua Wen, He Ling Jiang, Mei Zhang, Jun Ling Song
Abstract:Breadth first search is one of the most convenient traversal methods of a graph, and the shortest path problem of the city map is a kind of...
25
Authors: Jie Ling, Qiu Ping Zhang, Wan Min Huan
Chapter 3: Communication, Computer Engineering and Information Technologies
Abstract:Network fault location is the premise of fault repair. Event correlation technique is an important fault location strategy which has its own...
2410