Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows
Transportation Science
Regrets only! online stochastic optimization under time constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Dynamic vehicle routing with stochastic requests
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Online stochastic and robust optimization
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Online stochastic optimization in the large: application to kidney exchange
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Gap reduction techniques for online stochastic project scheduling
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Amsaa: a multistep anticipatory algorithm for online stochastic combinatorial optimization
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
| Hi-index | 0.00 |
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Contrary to earlier algorithms which only move vehicles to known customers, this paper investigates waiting and relocation strategies in which vehicles may wait at their current location or relocate to arbitrary sites. Experimental results show that waiting and relocation strategies may dramatically improve customer service, especially for problems that are highly dynamic and contain many late requests. The decisions to wait and to relocate do not exploit any problem-specific features but rather are obtained by including choices in the online algorithm that are necessarily sub-optimal in an offline setting.