과제정보
본 연구는 국토교통부 자율주행 기술개발 혁신사업의 연구비 지원(과제 번호: 22AMDP-C161991-02)에 의해 수행되었습니다.
참고문헌
- Araoz, J., Fernandez, E. and Meza, O.(2009), "Solving the prize-collecting Rural Postman Problem", European Journal of Operational Research, vol. 196, pp.886-896. https://doi.org/10.1016/j.ejor.2008.04.037
- Chentsov, A., Khachay, M. and Khachay, D.(2016), "Linear time algorithm for Precedence Constrained Asymmetric Generalized Traveling Salesman Problem", IFAC-Papers Online, 49-12, pp.651-655. https://doi.org/10.1016/j.ifacol.2016.07.767
- Edmonds, J. and Johnson, E. L.(1973), "Matching, Euler Tors and the Chinese Postman", Mathematical Programming, vol. 5, pp.88-124. https://doi.org/10.1007/BF01580113
- Eiselt, H. A., Gendreau, M. and Laporte, B.(1995), "Arc Routing Problems, Part I: The Chinese Postman Problem", Operational Research, vol. 43, no. 2, pp.231-242. https://doi.org/10.1287/opre.43.2.231
- Estevez-Fernandez, A. and Hamers, H.(2020), "Chinese postman games with multi-located players", European Journal of Operational Research, 285, pp.458-469. https://doi.org/10.1016/j.ejor.2020.01.062
- Hernandez, P., Peris, J. E. and Vidal-Puga, J.(2022), "A non-cooperative approach to the folk rule in minimum cost spanning tree problems", European Journal of Operational Research, Online.
- Kim, K. O., Choi, J. M. and Cho, S. A.(2022) "A study on the methods for managing hazard factors to support operation of automated driving vehicles in perspective of road infrastructure", The Journal of the Korea Institute of Intelligent Transportation System, vol. 21, no. 2, pp.62-73. https://doi.org/10.12815/kits.2022.21.2.62
- Ministry of Land, Infrastructure and Transport(2013), Highway capacity manual, pp.146-169.
- Roberti, R. and Toth, P.(2012), "Models and algorithms for the asymmetric traveling salesman problem: An experimental comparison", EURO Journal on Transportation and Logistics, vol. 1, pp.113-133. https://doi.org/10.1007/s13676-012-0010-0