Algorithm for the optimal riding scheme problem in public traffic

被引：0

作者：

Dong, JY ^{[1
]}

Chen, LZ ^{[1
]}

机构：

[1] Xiamen Univ, Dept Phys, Xiamen 361005, Fujian, Peoples R China

来源：

PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON NEURAL NETWORKS AND BRAIN, VOLS 1-3 | 2005年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A two-stage algorithm is proposed for the optimal riding scheme problem in public traffic querying system. The first stage is to find out the least transfer schemes, in which Bus Line Network model is presented to convert the least transfer scheme problem into the shortest path problem. The second stage is to search out the optimal riding scheme from the least transfer schemes, in which the transfer network is constructed to convert the optimal riding scheme problem into the constraint shortest path problem, and the algorithm for the constraint shortest path problem is also presented. Some examples are given to show the correctness and effectiveness of the proposed algorithm.

引用

页码：62 / 66

页数：5

共 8 条

[1] A neural network for shortest path computation [J].

Araújo, F ;

Ribeiro, B ;

Rodrigues, L .

IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (05) :1067-1073

[2] Finding the shortest path in the shortest time using PCNN's [J].

Caulfield, HJ ;

Kinser, JM .

IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (03) :604-606

[3]

DONG JY, 2003, ICMLC, P1157

[4]

LU ZB, 2001, J HIGHWAY TRANSPORTA, V18, P68

[5]

WU Z, 2000, B SURVEYING MAPPING, V45, P17

[6]

Zhang JP, 2003, J RARE EARTH, V21, P92

[7]

ZHANG JY, 2003, SCI CHINA SER E, V33, P522

[8]

ZHANG S, 2003, J HUAZHONG U SCI TEC, V31, P313

← 1 →