Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
A Robust Solution Approach to the Dynamic Vehicle Scheduling Problem
Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows
Transportation Science
Waiting Strategies for Dynamic Vehicle Routing
Transportation Science
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Transportation Science
Dynamic vehicle routing using genetic algorithms
Applied Intelligence
Assessing an ambulance service with queuing theory
Computers and Operations Research
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Computers and Operations Research
Survey: The vehicle routing problem: A taxonomic review
Computers and Industrial Engineering
ASAP: The After-Salesman Problem
Manufacturing & Service Operations Management
Online vehicle routing and scheduling with dynamic travel times
Computers and Operations Research
Look-ahead heuristics for the dynamic traveling purchaser problem
Computers and Operations Research
An improved LNS algorithm for real-time vehicle routing problem with time windows
Computers and Operations Research
Knowledge-based modeling for disruption management in urban distribution
Expert Systems with Applications: An International Journal
A PAM approach to handling disruptions in real-time vehicle routing problems
Decision Support Systems
International Journal of Applied Logistics
| Hi-index | 0.00 |
Recent technological advances in communication systems now allow the exploitation of realtime information for dynamic vehicle routing and scheduling. It is possible, in particular, to consider diverting a vehicle away from its current destination in response to a new customer request. In this paper, a strategy for assigning customer requests, which includes diversion, is proposed, and various issues related to it are presented. An empirical evaluation of the proposed approach is performed within a previously reported tabu search heuristic. Simulations compare the tabu search heuristic, with and without the new strategy, on a dynamic problem motivated from a courier service application. The results demonstrate the potential savings that can be obtained through the application of the proposed approach.