A road timetableTM to aid vehicle routing and scheduling
Computers and Operations Research
Block-layout design using MAX-MIN ant system for saving energy on mass rapid transit systems
IEEE Transactions on Intelligent Transportation Systems
Dynamic fuzzy logic-ant colony system-based route selection system
Applied Computational Intelligence and Soft Computing
Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information
Computers and Operations Research
Travel time prediction for dynamic routing using ant based control
Winter Simulation Conference
A Markov process based dilemma zone protection algorithm
Winter Simulation Conference
Self-adaptive length genetic algorithm for urban rerouting problem
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Computers and Industrial Engineering
Dynamic shortest path problems: Hybrid routing policies considering network disruptions
Computers and Operations Research
| Hi-index | 0.00 |
Routing vehicles based on real-time traffic conditions has been shown to significantly reduce travel time, and hence cost, in high-volume traffic situations. However, taking real-time traffic data and transforming them into optimal route decisions are a computational challenge. This is in a large part due to the amount of data available that could be valuable in the route selection. The authors model the dynamic route determination problem as a Markov decision process (MDP) and present procedures for identifying traffic data having no decision-making value. Such identification can be used to reduce the state space of the MDP, thereby improving its computational tractability. This reduction can be achieved by a two-step process. The first is an a priori reduction that may be performed using a stationary deterministic network with upper and lower bounds on the cost functions before the trip begins. The second part of the process reduces the state space further on the nonstationary stochastic road network as the trip optimally progresses. The authors demonstrate the potential computational advantages of the introduced methods based on actual data collected on a road network in southeast Michigan.