Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix

Abstract:

Article Preview

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 et al., "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:

$35.00

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

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