An Improved Evolutionary Algorithm for Dynamic Vehicle Routing Problem with Time Windows
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Survey: The vehicle routing problem: A taxonomic review
Computers and Industrial Engineering
Block-layout design using MAX-MIN ant system for saving energy on mass rapid transit systems
IEEE Transactions on Intelligent Transportation Systems
IEEE Transactions on Intelligent Transportation Systems
Performance of multiagent taxi dispatch on extended-runtime taxi availability: a simulation study
IEEE Transactions on Intelligent Transportation Systems
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
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
Dynamic shortest path problems: Hybrid routing policies considering network disruptions
Computers and Operations Research
Hi-index | 0.00 |
This paper examines the value of real-time traffic information to optimal vehicle routing in a nonstationary stochastic network. We present a systematic approach to aid in the implementation of transportation systems integrated with real-time information technology. We develop decision-making procedures for determining the optimal driver attendance time, optimal departure times, and optimal routing policies under time-varying traffic flows based on a Markov decision process formulation. With a numerical study carried out on an urban road network in Southeast Michigan, we demonstrate significant advantages when using this information in terms of total cost savings and vehicle usage reduction while satisfying or improving service levels for just-in-time delivery.