시간종속 네트워크에서의 최소지연경로 선정

다국어 초록 (Multilingual Abstract)

In many researches on time dependent network, algorithms for finding a shortest path have been studied Their objective is to minimize the arrival time to the destination given a starting time at the origin. In most of existing researches on time-dependent network, the problem, finding the minimum delay path given an interval of starting time, seems to be neglected. In this paper, we seek to find both a path having the minimum delay in the network and an optimal starting time at the origin given a interval of possible starting time at the origin. First, we propose a new algorithm for finding shortest paths for all starting time. Second, we present an algorithm for finding an optimal starting time and the corresponding minimum delay path.

목차 (Table of Contents)

• Abstract
  
• 1. 서론
  
• 2. 네트워크에서의 최소지연시간
  
• 3. 유효최단경로
  
• 4. 최소지연경로 해법
  
• 5. 결론
  
• 참고문헌