All Issue

2016 Vol.34, Issue 6 Preview Page
December 2016. pp. 560-579
Abstract
References

References

1
Azevedo J. A., Costa M. E. O. S., Madeira J. J. E. R. S., Martins E. Q. V. (1993), An Algorithm for the Ranking of Shortest Paths, European Journal of Operational Research, 69, 97-106.10.1016/0377-2217(93)90095-5
2
Bellman R. (1957), Dynamic Programming, Princeton University Press, Princeton, New Jersey.
3
Cascetta E., Agostino N., Francesco R., Antonino V. (1996) A Modified Logit Route Choice Model Overcoming Path Overlapping Problems, Specification and Some Calibration Result for Interurban Networks, Transportation and Traffic Theory, Pergamon, 697-711.
4
Chen P., Nie Y. (2013), Bicriterion Shortest Path Problem With A General Nonadditive Cost, Social and Behavioral Sciences, 80, 553-575.
5
Dial R. B. (1971) A Probabilistic Multi-Path Traffic Assignment Algorithm Which Obviates Path Enumeration, Transportation Research, 5, 83-111.10.1016/0041-1647(71)90012-8
6
Gabriel S., Bernstein D. (1997), The Traffic Equilibrium Problem With Nonadditive Path Costs, Transportation Science, 20(5), 337-348.10.1287/trsc.31.4.337
7
Jung D., Chang J. S. (2014), Evaluation of the Performance of Transit Assignment Algorithms for Urban Rail Networks, Journal of the Korean Society for Railway, 17(6), 433-442.10.7782/JKSR.2014.17.6.433
8
Lee M. (2015), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.
9
Lim Y. T. (2003) Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model, J. Korean Soc. Transp., 21(2), Korean Society of Transportation, 95-105.
10
Martins E. Q. V. (1984), An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, 18, 123-130.10.1016/0377-2217(84)90269-8
11
Pollack M. (1961), The Kth Best Route Through A Network, Operations Research.10.1287/opre.9.4.578
12
Sheffi Y. (1985) Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods, Prentice-Hall, New York.
13
Sheffi Y., Powell W. B. (1982) An Algorithm for the Equilibrium Assignment Problem With Random Link Times, Networks, 12(2), 191-207.10.1002/net.3230120209
14
Shier R. D. (1979), On Algorithm From Finding the K Shortest Paths in A Network, Networks, 9, 195-214.10.1002/net.3230090303
15
Shin S. I., Baek N. C., Nam D. H. (2016), A Heuristic Optimal Path Search Considering Cumulative Transfer Functions, Journal of Intelligent Transportation Systems, 15(3), 60-67.
16
Yang Y., Zhang X., Meng Q. (2004), Modeling Private Highways in Networks With Entry-Exit Based Toll Charges, Transportation Research B, 38, 191-213.10.1016/S0191-2615(03)00050-X
17
Yen J. Y. (1971), Finding the K Shortest Loopless Paths in A Network, Management Science, 17, 711-715.10.1287/mnsc.17.11.712
Information
  • Publisher :Korean Society of Transportation
  • Publisher(Ko) :대한교통학회
  • Journal Title :Journal of Korean Society of Transportation
  • Journal Title(Ko) :대한교통학회지
  • Volume : 34
  • No :6
  • Pages :560-579
  • Received Date : 2016-10-20
  • Revised Date : 2016-12-06
  • Accepted Date : 2016-12-14