Waiting and relocation strategies in online stochastic vehicle routing
作者： Pascal Van Hentenryck , Russell Bent
DOI:
关键词:
摘要: This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize number of serviced customers. Contrary earlier algorithms only move vehicles known customers, this investigates waiting relocation strategies may wait at their current location or relocate arbitrary sites. Experimental results show that dramatically improve customer service, especially for problems are highly dynamic contain many late requests. The decisions do not exploit any problem-specific features but rather obtained by including choices algorithm necessarily sub-optimal an offline setting.
ijcai.org
lanl.gov 参考文章(15)
Robert Givan, Edwin K. P. Chong, Hyeong Soo Chang, On-line scheduling via sampling international conference on artificial intelligence planning systems. pp. 62- 71 ,(2000)
Russell Bent, Irit Katriel, Pascal Van Hentenryck, Sub-optimality Approximations Principles and Practice of Constraint Programming - CP 2005. pp. 122- 136 ,(2005) , 10.1007/11564751_12
Pascal Van Hentenryck, Russell Bent, Regrets only! online stochastic optimization under time constraints national conference on artificial intelligence. pp. 501- 506 ,(2004)
Pascal Van Hentenryck, Russell Bent, The value of consensus in online stochastic scheduling international conference on automated planning and scheduling. pp. 219- 226 ,(2004)
Pascal Van Hentenryck, Russell Bent, Dynamic vehicle routing with stochastic requests international joint conference on artificial intelligence. pp. 1362- 1363 ,(2003)
Russell Bent, Pascal Van Hentenryck, Online stochastic and robust optimization Lecture Notes in Computer Science. pp. 286- 300 ,(2004) , 10.1007/978-3-540-30502-6_21
Jano I. van Hemert, J. A. La Poutré, Dynamic routing problems with fruitful regions: models and evolutionary computation parallel problem solving from nature. ,vol. 3242, pp. 692- 701 ,(2004) , 10.1007/978-3-540-30217-9_70
Thierry Benoist, Eric Bourreau, Yves Caseau, Benoît Rottembourg, Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines Principles and Practice of Constraint Programming — CP 2001. pp. 61- 76 ,(2001) , 10.1007/3-540-45578-7_5
Snežana Mitrović-Minić, Gilbert Laporte, Waiting strategies for the dynamic pickup and delivery problem with time windows Transportation Research Part B-methodological. ,vol. 38, pp. 635- 655 ,(2004) , 10.1016/J.TRB.2003.09.002
Allan Larsen, Oli B. G. Madsen, Marius M. Solomon, The A Priori Dynamic Traveling Salesman Problem with Time Windows Transportation Science. ,vol. 38, pp. 459- 472 ,(2004) , 10.1287/TRSC.1030.0070