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

Cai Xia Zhang; Liang Liang Zhuang; Xiang Dong Wang; Hai Wu Rong

doi:10.4028/www.scientific.net/AMM.40-41.341

Paper Titles

Construct and Perfect the System of China’s Energy Policy
p.322

The Design of Fast Pulse Power Generator with Low Voltage
p.327

A Microstrip to Rectangular Waveguide Transition Using Coupling Loop in Millimeter-Wave Band
p.331

The Influence of Chlorine on the Migration Behavior of Alkali Metal during Biomass and Coal Co-Combustion
p.335

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

Study on Optimization of Multi-Type Aircraft Scheduling Robust Model
p.347

Experiment Study of Rock Damage and Permeability Meso-Mechanical Coupling Failure Model under Complex Condition
p.354

OPNET-Based Computer Simulation of MPLS VPN Security Solutions
p.361

Research and Implementation of a Communication Method for Health Status Monitoring in Civil Engineering
p.366

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 40-41Research on Optimal Routing Algorithm for Public...

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 40-41)

Pages:

341-346

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.40-41.341

Citation:

Cite this paper

Online since:

November 2010

Authors:

Cai Xia Zhang, Liang Liang Zhuang, Xiang Dong Wang, Hai Wu Rong

Keywords:

Least Transfer, Matrix, Optimal Route, Two-Step-Descending-Proliferation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] WONG S C, TONG C O. Estimation of time dependent origin destination matrices for transit network[J]. Transportation Research B, 1998, 32 (1): 35248.

DOI: 10.1016/s0191-2615(97)00011-8

Google Scholar

[2] WENG Min, WU Hehai, DU Qingyun, CAI Zhongliang. An Optimal Route Choice Based on Public Traffic Network Model[J]. Editorial Board of Geomatics and Information Science of Wuhan University, 2004, 29(6): 105-305.

Google Scholar

[3] Liu C L, Pai T W, Chang C T, et al. Path2planning algorithms for public transportation systems [A]. In: Proc of the 4th International IEEE Conference on Intelligent Transportation Systems [C]. Oakland, USA , 2001. 1061-1066.

Google Scholar

[4] Wang Li, Li Wenquan. Best-routing algorithm for public transportation systems[J]. Journal of Southeast University (Natural Science Edition), 2004, 34（2）: 264-267.

Google Scholar

[5] WANG Zhen-jun, WANG Ning-ning, LI Hong, NIU Hong-liang. Research on Algorithm of Public Transit Transfer under the Adjacency Matrix [J]。Xuzhou Institute of Technology, 2006，21（3）：74-77.

Google Scholar

[6] HE Di1, YAN Yusong, GUO Shoujing, HAO Guang. Optimal Routing Algorithm for Public Traffic Network Based on Matrix Analysis[J]. Journal of Southwest Jiaotong University, 2007, 4(3）: 315-319.

Google Scholar