Browse > Article

On Finding an Optimal Departure Time in Time-Dependent Networks  

Park, Chan-Kyoo (Dept. of IT Audit & Supervision, National Computerization Agency)
Lee, Sangwook (Dept. of Industrial Engineering, Seoul National University)
Park, Soondal (Dept. of Industrial Engineering, Seoul National University)
Publication Information
Management Science and Financial Engineering / v.10, no.1, 2004 , pp. 53-75 More about this Journal
Abstract
Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.
Keywords
Minimum delay; Shortest path; Departure time;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, 1993
2 E. D. Miller, H. S. Mahmassani, A. Ziliaskopoulos, 'Path search techniques for transportation networks with time-dependent, stochastic arc costs,' Proc. of 1994 IEEE International Conference on Systems, Men and Cybernetics, Part 2, 1716-1721   DOI
3 N. E. Young, R. E. Tarjan and J. B. Orlin, 'Faster parametric shortest path and minimum-balance algorithms,' Networks 21 (1991), 205-221   DOI
4 A. K. Ziliaskopoulos, H. S. Mahmassani, 'Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications,' Tranportations Science Record 1408 (1993), 94-100
5 M. I. Henig, 'The shortest path problem with two objective functions,' European Journal of Operational Research 25 (1985), 281-291   DOI   ScienceOn
6 Garcia, A., Amin, S. M.,Wooton, J. R., 'Intelligent Transportation Systems Enabling Technologies', Mathl. Comput. Modelling., 22, 4-7 (1995), 11-81   DOI   ScienceOn
7 N. Ravi and R. E. Wendell, 'The tolerance approach to sensitivity analysis in network linear programming,' Networks 18 (1988), 159-171   DOI   ScienceOn
8 Bellman, R., 'On a routing problem,' Quart. Appl. Mathematics 16 (1958), 87-90   DOI
9 D. R. Shier and Christoph Witzgall, 'Arc tolerances in shortest path and network flow problems, Networks 10 (1980), 277-291   DOI
10 Kaufman, D. E., R. L. Smith, 'Minimum travel time paths in dynamic networks with application to intelligent vehicle highway systems,' IVHS Journal, To appear
11 Sung, K., M.G.H. Bell, M. Seong, S. Park, 'Shortest paths in a network with time-dependent flow speeds,' European Journal of Operational Research 121 (2000), 32-39   DOI   ScienceOn
12 Cooke, K. L., E. Halsey, 'The shortest route through a network with timedependent internodal transit times', Journal of Math. Anal. Appl., 14 (1966), 492-498   DOI
13 Myung-Seok Lee, Soondal Park, 'A study on shortest problem between specified nodes with multiple travel time,' Korean Management Science Review 7, 2 (1990), 51-57, 17   과학기술학회마을
14 A. Orda and R. Rom, 'Shortest-path and minimum-delay algorithms in Networks with Time-Dependent Edge-Length,' Journal of the ACM 37, 3 (1997), 607-625   DOI