Dynamic vehicle routing with stochastic requests

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1362-1363

  Bent, Russell ^a   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC VEHICLE ROUTING; LARS-EN; MAIL SERVICES; PLAN EXECUTION; SCENARIO APPROACH; SERVICE TIME; VEHICLE ROUTING PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 34250780833     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. R. Bent and P. Van Hentenryck. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. To appear in Transportation Science
2. R. Bent and P. Van Hentenryck. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers. To appear in Operations Research (pending minor revisions).
3. M. Gendreau, F. Guertin, J. Y. Potvin, and E. Taillard. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33 (4):381 390,1999.
4. A. Larsen, O. Madsen, and M. Solomon. Partially Dynamic Vehicle Routing-Models and Algorithms. Journal of Operational Research Society, 53:637-646, 2002. (Pubitemid 34658252)
5. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Principles and Practice of Constraint Programming, 417-431, 1998.