참고문헌
- 신성일 (2004), 교통망에 적합한 K 비루프 경로 탐 색 알고리즘, 대한교통학회지, 제22권 제6호, 대한교통학회, pp.121-131
- 임용택 (2004), 일반가로망에서 교통정보제공을 위한 n-path 알고리듬의 개발, 대한교통학회지, 제22권 제4호, 대한교통학회, pp.135-145
- 임강원, 임용택 (2003), 교통망분석론, 서울대학교출판부
- Azevedo J. A., Costa M. E. O. S., Madeira J.J.E.R.S., and Martins E.Q.V. (1993), An Algorithm from the Ranking of Shortest Paths, European Journal of Operational Research, Vol. 69, pp.97-106 https://doi.org/10.1016/0377-2217(93)90095-5
- Bellman R. and Kalaba R. (1968), On Kth Best Policies. J. SIAM 8, pp.582-588
- Bellman R. (1957), Dynamic Programming, Princeton University Press, Princeton, New Jersey
- Ben-Akiva M. et al. (1998), Development of a Deployable Real-time Dynamic Traffic Assignment System. Report to the Oak Ridge National Laboratory and Federal Highway Administration
- Cooke K. L. and Halsey E. (1966), The Shortest Route through A Network with Timeependent Intermodal Transit Times, Journal of Math. Anal. Appl. 14, pp.493-498 https://doi.org/10.1016/0022-247X(66)90009-6
- De Cea. J. and J.E. Fernandez. (1993), Transit Assignment for Congested Public Transport Systems: An Equilibrium Model, Transportation Science Vol. 27
- Dijkstra E. W. (1959), A Note of Two Problems in Connected with Graphs. Numerical Mathematics. I, pp.269-271
- Dreyfus S. E. (1969), An Appraisal of Some Shortest-Path Algorithms, Operations Research 17, pp.396-412
- Fredman M. L. and Tarjan R. E. (1987), Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms, JACM, pp.596-615
- Hall R. W. (1986), The Fastest Path through A Network with Random Time-Dependent Travel Times, Transportation Science 20, pp.182-188 https://doi.org/10.1287/trsc.20.3.182
- Kirby R. F. and Potts R. B. (1969), The Minimum Route Problem for Networks with Turn Penalties and Prohibitions. Transportation Research 3, pp.397-408 https://doi.org/10.1016/S0041-1647(69)80022-5
- Halpern J. and Priess I. (1974), Shortest Path with Time Constraints on Movement and Parking. Networks 4, pp.241-253 https://doi.org/10.1002/net.3230040304
- Kaufman D. E. and Smith R. L. (1993), Minimum Travel Time Paths in Dynamic Networks with Application to Intelligent Vehicle/Highway Systems, IVHS Journal, pp.1-19
- Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Thesis, University of Wisconsin-Madison
- Lozano A. and Storchi G. (2001), Shortest Viable Path Algorithm in Multimodal Networks, Transportation Research A 35(3), pp.225-241 https://doi.org/10.1016/S0965-8564(99)00056-7
- Lozano A. and Storchi G. (2002), Shortest Viable Hyperpath in Multimodal Networks, Transportation Research B 36, pp.853-874 https://doi.org/10.1016/S0191-2615(01)00038-8
- Mahmassani H.S., Peeta S., Hu T.Y. and Ziliaskopoulos A. (1993), Dynamic Traffic Assignment with Multiple User Classes for Real-time ATIS/ATMS Applications in Large Urban Systems. Proceedings of the Advanced Traffic Management Conference, Federal Highway Administration, US Department of Transportation, Washington D.C., pp.91-114
- Martins E.Q.V. (1984), An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, Vol. 18, pp.123-130 https://doi.org/10.1016/0377-2217(84)90269-8
- Moore E. F, The Shortest Path through A Maze. Proc. Int. Conf. on the Theory of Switching. Harvard Univ.', Cambridge, MA., 1957
- Orda A. and Rom R. (1990), Shortest-Path and Minimal-Delay Algorithms in Networks with Time-Dependent Edge-Length, Journal of the ACM 37, pp.607-625 https://doi.org/10.1145/79147.214078
- Orda A. and Rom R. (1991), Minimum-Weight Paths in Time-Dependent Networks, Networks 21, pp.295-319 https://doi.org/10.1002/net.3230210304
- Park, D.(1998), Multipl Path Based Vehicle Routing In Dynamic And Stochastic Transportation Networks, Ph. D. Dissertation, Texas A&M University
- Pollack M. (1961), The Kth Best Route Through A Network, Operations Research, Vol. 9, pp.578-580 https://doi.org/10.1287/opre.9.4.578
- Potts R.B. and Oliver R.M.(1972), Flows in Transportation Networks. Academic Press
- Ran, B. and Boyce, D.E. (1996), Modeling Dynamic Transportation Networks–An Intelligent Transportation System Oriented Approach. Springer-Verlag, Heidelgerg
- Shier R. D. (1979), On Algorithms from Finding the k Shortest Paths in a Network, Networks, Vol. 9, pp.195-214 https://doi.org/10.1002/net.3230090303
- Shin S. I. (2001), Analytical Dynamic Traffic Assignment Approaches for Modeling Integrated Real-Time Traffic Control Systems. Ph.D. Dissertation, University of Wisconsin at Madison
- Yang H.H. and Chen Y.L. (2005), Finding K Shortest Looping Paths in A Traffic-Light Network, Computer & Operations Research 32, pp.571-581 https://doi.org/10.1016/j.cor.2003.08.004
- Tong C. O. and Richardson A. J. (1984), Computer Model for Finding the Timeependent Minimum Path in Transit Systems with Fixed Schedules, Journal of Advanced Transportation 18, pp.145-161 https://doi.org/10.1002/atr.5670180205
- Van Aerde M. (1992), INTEGRATION: A Dynamic Traffic Simulation/Assignment Model, Presented on the IVHS Dynamic Traffic Assignment and Simulation Workshop, Federal Highway Administration, McLean, VA
- Yen J.Y. (1971), Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp.711-715
- Ziliaskopoulos A (1994), Optimum Path Algorithms on Multidimensional Networks: Analysis, Design, Implementation and Computational Experience, Ph.D. Dissertation, The University of Texas at Austin
- Ziliaskopoulos A. and Wardell W. (2000), An Intermodal Optimum Path Algorithm for Multimodal Networks with Dynamic Arc Travel Times and Switching Delays. European Journal of Operational Research 125, pp.486-502 https://doi.org/10.1016/S0377-2217(99)00388-4