References
- 김영찬 . 김태용(2001). '검지자료합성을 통한 도시 간선도로 실시간 통행시간 추정모형,' 대한교통학회지, 제19권 제6호, 대한교통학회. pp.171-182
- 김태진 . 한민홍(2001). '중앙집중형 도로교통정보 시스템에서 다중경로탐색 알고리즘', 대한교통학회지, 제19권 제6호, 대한교통학회. pp.183-194
- 장인성 . 문형수( 2001). '유전자 알고리즘을 이용한 도시도로망에서의 첨단 여행자 정보시스템 운영계획, 대한교통학회지, 제 19권 제4호, 대한교통학회, pp.85-96
- Adler. J. L., and Blue. V. J. (2002). 'A Cooperative Multi-agent Transportation Management and Route Guidance System,' Transportation Research. Part C. Emerging Technologies, VoL 10. pp.433-454 https://doi.org/10.1016/S0968-090X(02)00030-X
- Ahuja. R. K., Magnanti. T. L. and Orlin. J. B. (1993). Network Flows. Prentice Hall
- Backhouse, R. C., van den Ei,inde, J. P. H. W. and van Gasteren, A. J. M. (1994), Calculating Path Algorithms, Science of Computer Programming, Vol.22. pp.3-19 https://doi.org/10.1016/0167-6423(94)90005-1
- Blewett, W. J. and Hu. T. C. (1997), 'Tree Decomposition Algorithm for Large Networks.' Networks, Vol.7. pp.289-296 https://doi.org/10.1002/net.3230070402
- Choi, G. S., Seo, K. S. and Park, J. J. (2002). 'Using Evolution Program to Develop Effective Search Method for Alternative Routes,' Journal of Korea Society of Transportation. Vol.20, No.2, pp.71-79
- Chou, Y.-L.. Romei,in , H. E. and Smith, R. L. (1998). 'Approximating Shortest Paths in Large-scale Networks with an Application to Intelligent Transportation Systems.' INFORMS Journal on Computing. Vol.10. No.2, pp.163-179 https://doi.org/10.1287/ijoc.10.2.163
- Deflorio, F. P. (2003). 'Evaluation of a React ive Dynamic Route Guidance Strategy,' Transportation Research. Part C, Emerging Technologies. Vol.11, No.5, pp.375-388 https://doi.org/10.1016/S0968-090X(03)00031-7
- Fu, L. (2001). 'An Adaptive Routing Algorithm for In-vehicle Route Guidance Systems with Real-time Information,' Transportation Research Part B, Methodological. Vol.35. pp.749-765 https://doi.org/10.1016/S0191-2615(00)00019-9
- Gallo, G. and Pallottino, S. (1988), 'Shortest Path Algorithms,' Annals of Operations Research, Vol.13, pp.3-79
- Giarratano, J. and Riley. G. (1998), Expert Systems. Principles and Programming, PWS Publishing Company
- Han. Y.. Pan, V. Y. and Reif. J. H. (1997). Efficient Parallel Algorithm for Computing All Pair Shortest Paths in Di rected Graphs. Algorithmica , Vol.17. pp.399-415. https://doi.org/10.1007/BF02523680
- Hounsell, N. B. and Ishtiaq , S. (1997), 'Journey Time Forecasting for Dynamic Route Guidance Systems in Incident Conditions.' International Journal of Forecasting, Vol.13, pp.33-42 https://doi.org/10.1016/S0169-2070(96)00698-X
- Hu. T. C. (1968), 'A Decomposition Algorithm for Shortest Paths in a Network,' Operations Research, Vol.16. pp.91-102 https://doi.org/10.1287/opre.16.1.91
- Hu, T. C. and Torres, W. T. (1969). 'Shortcut in the Decomposition Algorithm for Shortest Paths in a Network' IBM Journal of Research and Development. Vo1.13. pp.387-390. https://doi.org/10.1147/rd.134.0387
- Kaysi. I., Ben-Akiva, M. and Koutsopoulos. H. (1993), 'Integrated Approach to Vehicle Routing and Congestion Prediction for Real-time Driver Guidance,' Transportation Research Record. Issue 1408. pp.66-74
- Kim. S. I. & Kim, H. (2002). 'Design and Implementation of an Intelligent System for Real-time Route Guidance,' IE Interface, Vol.15. No.4, pp.374-381.
- Lee, C. (1994), 'A Multiple-Path Routing Strategy for Vehicle Route Guidance Systems, Transportation Research: Part C, Vol.2. No.3 , pp.185-195 https://doi.org/10.1016/0968-090X(94)90008-6
- Liu. B. (1997). 'Route Finding by Using Knowledge about the Road Network,' IEEE Transactions on Systems, and Cybernetics - Part A: Systems and Humans, Vol.27, No.4, pp .436-448 https://doi.org/10.1109/3468.594911
- Lysgaard, J. (1995), 'A Two-phase Shortest Path Algorithm for Networks with Node Coordinates,' European Journal of Operational Research. Vol.87, pp.368-374 https://doi.org/10.1016/0377-2217(94)00152-3
- Mills , G. (1966), 'A Decomposition Algorithm for the Shortest-route Problem,' Operations Research, Vol.14. pp.279-291 https://doi.org/10.1287/opre.14.2.279
- Namkoong, S., Rho, J. H. and Choi. J. U. (1998). 'Development of the Tree-based ink Labeling Algorithm for Optimal Path-finding in Urban Transportation Networks,' Mathematical and Computer Modelling. Vol.27, pp.51-65
- Nemhauser, G. L. (1966). Introduction to Dynamic Programrning. John Wiley & Sons, Inc
- Nemhauser, G. L. (1988). Integer and Combinatorial Optimization, John Wiley & Sons. Inc
- Noto, M. and Sato , H. (2000), 'A Method for the Shortest Search by Extended Di.ikstra Algorithm,' IEEE International Conference on Systems, Man, and Cybernetics , Vol.3, pp.2316-2320
- Park, C.-K., Sung, K., Doh, S. and Park, S. (2001), 'Finding a Path in the Hierarchical Road Networks,' 2001 IEEE Intelligent Transportation Systems Proceedings. pp.936-942
- Romeijn, H. E. and Smith, R. L. (1999), Parallel Algorithms for Solving Aggregated Shortest-path Problems,' Computers and Operations Research, Vol.26, pp.941-953 https://doi.org/10.1016/S0305-0548(99)00029-5
- Sanders, B. A. (2001), 'The Shortest Path in Parallel' Information Processing Letters. Vol.77. pp.213-217 https://doi.org/10.1016/S0020-0190(00)00203-9
- Sen, A., Soot, S., Thakuriah, P. and Condie, H. (1998), 'Estimation of Static Travel Times in a Dynamic Route Guidance System - II,' Mathematical and Computer Modelling, Vol.27. pp.67-85 https://doi.org/10.1016/S0895-7177(98)00052-1
- Sen, A. and Thakuriah, P. (1995), 'Estimation of Static Travel Times in a Dynamic Route Guidance System, Mathematical and Computer Modelling, Vol.22, pp.83-101
- Shapiro, J., Waxman, J. and Nir, D. (1992), 'Level Graphs and Approximate Shortest Path Algorithms,' Networks. Vol.22, pp.691 -717 https://doi.org/10.1002/net.3230220707
- Thakuriah, P. and Sen, A. (1996), 'Quality of Information Given by Advanced Traveler Information Systems, Transportation Research: Part C, Vol.4, No.5, pp.249-266 https://doi.org/10.1016/S0968-090X(97)82900-2
- Wahle, J., Annen, O., Schuster, C.. Neubert, L, and Schreckenberg, M. (2001), 'A Dynamic Route Guidance System Based on Real Traffic Data,' European Journal of Operational Research , Vol.13. pp.302-308
- Yu, G. and Yang, J. (1998), 'On the Robust Path Problem,' Computers and Operations Research, Vol.25, No.6, pp.457-468 https://doi.org/10.1016/S0305-0548(97)00085-3
- Zhan, F. B. and Noon, C. E. (1998), 'Shortest Path Algorithms: An Evaluation Using Real Road Networks,' Transportation Science, Vol.32, No.1. pp.65-73 https://doi.org/10.1287/trsc.32.1.65
- Ziliaskopoulos, A., Kotzinos, D. and Mahmassani, H. S. (1997), 'Design and Implementation of Parallel Time-dependent Least Time Path Algorithms for Intelligent Transportation Systems Applications,' Transportation Research: Part C, Vol.5, No.2, pp.95-107 https://doi.org/10.1016/S0968-090X(97)00004-1
- Ziliaskopoulos, A. and Mahmassani, H. S. (1993),, 'Time-dependent, Shortest-path Algorithm for Real-time Intelligent Vehicle Highway System Applications.' Transportation Research Record, Issue 1408. pp.94-100