Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

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)
  • Published : 2004.05.01
Download PDF
⟨ Previous Next ⟩

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

References

  1. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, 1993
  2. Bellman, R., 'On a routing problem,' Quart. Appl. Mathematics 16 (1958), 87-90 https://doi.org/10.1090/qam/102435
  3. M. I. Henig, 'The shortest path problem with two objective functions,' European Journal of Operational Research 25 (1985), 281-291 https://doi.org/10.1016/0377-2217(86)90092-5
  4. Kaufman, D. E., R. L. Smith, 'Minimum travel time paths in dynamic networks with application to intelligent vehicle highway systems,' IVHS Journal, To appear
  5. 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
  6. 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 https://doi.org/10.1109/ICSMC.1994.400096
  7. 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 https://doi.org/10.1145/79147.214078
  8. D. R. Shier and Christoph Witzgall, 'Arc tolerances in shortest path and network flow problems, Networks 10 (1980), 277-291 https://doi.org/10.1002/net.3230100402
  9. 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 https://doi.org/10.1016/S0377-2217(99)00035-1
  10. N. Ravi and R. E. Wendell, 'The tolerance approach to sensitivity analysis in network linear programming,' Networks 18 (1988), 159-171 https://doi.org/10.1002/net.3230180303
  11. N. E. Young, R. E. Tarjan and J. B. Orlin, 'Faster parametric shortest path and minimum-balance algorithms,' Networks 21 (1991), 205-221 https://doi.org/10.1002/net.3230210206
  12. 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
  13. 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 https://doi.org/10.1016/0022-247X(66)90009-6
  14. Garcia, A., Amin, S. M.,Wooton, J. R., 'Intelligent Transportation Systems Enabling Technologies', Mathl. Comput. Modelling., 22, 4-7 (1995), 11-81 https://doi.org/10.1016/0895-7177(95)00127-N