References
- 신성일 (2004), 교통망에 적합한 K 비루프 경로 탐색 알고리즘, 대한교통학회지, 제22권 제6호, 대한교통학회, pp.121-131
- 장인성 (2000), 서비스시간 제약이 존재하는 도시 부 복합교통망을 위한 링크기반의 최단경로탐색 알 고리즘, 대한교통학회지, 제18권 제6호, 대한교통 학회, pp.111-121
- Bellman R. (1957), Dynamic Programming, Princeton University Press, Princeton, New Jersey
- Chen Y. L. and Tang K. (1997), Shortest Paths in Time‐Schedule Networks, International Journal of Operations and Quantitative Management, 3, pp.157-173
- Chen Y. L. and Tang K. (1998), Minimum Time Paths in A Network with Mixed Time Constraints, Computer Ops Res. Vol. 25, No. 10, pp.793-805 https://doi.org/10.1016/S0305-0548(98)00020-3
- Dijkstra E. W. (1959), A Note of Two Problems in Connected with Graphs. Numerical Mathematics. I, pp.269-271 https://doi.org/10.1007/BF01386390
- Desaulniers J. and Villeneuve D. (2000), The Shortest Path Problem with Time Windows and Linear Waiting Costs. Transportation Science, pp.312-319
- Desrosiers J. and Soumis F. (1988), A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with Time Windows. INFOR, 26. pp.191-211
- Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Dissertation, University of Wisconsin Madison
- Lo H.K., Yip C.W. and Wan K.H. (2003), Modeling Transfer and Non‐Linear Fare Structure in Multi Modal Network, Transportation Research Part B, pp.149-170
- 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
- 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
- Sancho N.G.F. (1994), Shortest Path Problems with Time Windows on Nodes and Arcs, Journal of Mathematical Analysis and Applications, pp.643-648
- 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
- Solomon, M. M. (1987), Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, 35, pp.254-265 https://doi.org/10.1287/opre.35.2.254
- Tong C.O. and Richardson A.J. (1984), A Computer Model for Finding the Time Dep endent Minimum Path in Transit Systems with Fixed Schedules, Journal of Advanced Transportation 18, pp.145-161 https://doi.org/10.1002/atr.5670180205
- 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
- Yen J.Y. (1971), Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp.711-715