Partially dynamic vehicle routing – models and algorithms

Partially dynamic vehicle routing – models and algorithms

0.00 Avg rating0 Votes
Article ID: iaor2003972
Country: United Kingdom
Volume: 53
Issue: 6
Start Page Number: 637
End Page Number: 646
Publication Date: Jun 2002
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: repairman problem
Abstract:

In this paper we propose a framework for dynamic routing systems based on their degree of dynamism. Next, we consider its impact on solution methodology and quality. Specifically, we introduce the Partially Dynamic Travelling Repairman Problem and describe several dynamic policies to minimize routing costs. The results of our computational study indicate that increasing the dynamic level results in a linear increase in route length for all policies studied. Furthermore, a Nearest Neighbour policy performed, on the average, uniformly better than the other dispatching rules studied. Among these, a Partitioning policy produced only slightly higher average route lengths.

Reviews

Required fields are marked *. Your email address will not be published.