By Topic

Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

We study a specific variant of the optimal routing policy problem in stochastic time-dependent networks where expected general travel costs are optimized. A stochastic time-dependent network is a network where the link travel times and the link travel costs are random variables with time-dependent distributions. A routing policy is defined as a decision rule that specifics what node to take next at each decision node based on the realized link travel times, the realized link travel costs and the current time. We assume the network users have perfect online travel time information and no travel cost information, implying that they have knowledge about all link travel time realizations up to the current time, but have no knowledge about any link travel cost realizations. An exact algorithm is designed, based on a specification of the generic optimality conditions presented in part I of this study. We then analyze the complexity of the exact algorithm and point out the importance of finding effective and efficient approximations to the exact algorithm. We proceed to present four approximations, and study their effectiveness against the exact algorithm theoretically.

Published in:

Intelligent Transportation Systems, 2002. Proceedings. The IEEE 5th International Conference on

Date of Conference: