Research on Urban Rail Transit Resource Allocation Based on K-Shortest Paths Algorithm
2013 ◽
Vol 748
◽
pp. 1285-1289
◽
Keyword(s):
This paper considers the major factors of passenger flow distribution and the running cost of train, explains and demonstrates how to sove the problem of urban rail transit resource allocation. The paper at first constructs urban rail network assignment model in the multiple operating lines based on the k-shortest paths algorithm, then proposes the k shortest paths search algorithm, finally the effectiveness of the model and algorithm are verified with the data from the Beijing urban rail transit network.
2012 ◽
Vol 450-451
◽
pp. 295-301
◽
Keyword(s):
2013 ◽
Vol 475-476
◽
pp. 737-742
Keyword(s):
Keyword(s):
2013 ◽
Vol 361-363
◽
pp. 1963-1966
Keyword(s):
Keyword(s):
2018 ◽
Vol 2018
◽
pp. 1-12
◽
Keyword(s):
Keyword(s):
2011 ◽
Vol 11
(6)
◽
pp. 124-130
◽
Keyword(s):
Keyword(s):