http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
박찬규(Chan-Kyoo Park),이상욱(Sangwook Lee),박순달(Soondal Park) 한국경영과학회 2002 한국경영과학회 학술대회논문집 Vol.2002-A No.-
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.