loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06)
A Reliable Routing Algorithm with Real Time and Historical Information
Beijing, China
August 30-September 01
ISBN: 0-7695-2616-0
Jiang Qian Ying, Gifu University, Japan
Jien Kato, Nagoya University, Japan
A traffic network with the following information structure is considered. The link travel times have probability distrbutions which are know from historical data. When the traveler arrives at a node, the actual travel times on the down streaming links are revealed to him. For given orign, destination, departure time and scheduled arrival time, the reliability of a routing strgetgly can be measured by the probability of arriving at destination before scheduled time. In this paper an algorithm is provided for generating a route by taking into account both the historical statistical infomation and real time information. The route generated has maximum probabilty of arriving at the destination before the scheduled time, under the adopted information structure..
Citation:
Jiang Qian Ying, Jien Kato, "A Reliable Routing Algorithm with Real Time and Historical Information," icicic, vol. 2, pp.557-560, First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.