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

被引：0

作者：

Zhang Caixia ^{[1
,2
]}

Zhuang Liangliang ^{[3
]}

Wang Xiangdong ^{[3
]}

Rong Haiwu ^{[3
]}

机构：

[1] Guangdong Univ Technol, Fac Automat, Guangzhou, Guangdong, Peoples R China

[2] Foshan Univ, Dept Automat, Foshan, Peoples R China

[3] Foshan Univ, Dept Math, Foshan, Peoples R China

来源：

ADVANCES IN SCIENCE AND ENGINEERING, PTS 1 AND 2 | 2011年 / 40-41卷

关键词：

matrix; optimal route; two-step-descending-proliferation; least transfer;

D O I：

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

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：341 / +

页数：2