| Article ID: | iaor2009697 |
| Country: | United Kingdom |
| Volume: | 4 |
| Issue: | 1 |
| Start Page Number: | 116 |
| End Page Number: | 133 |
| Publication Date: | Jan 2008 |
| Journal: | International Journal of Logistics Systems and Management |
| Authors: | Narendran T.T., Kumar Ch. S.N. Chandra Sunil |
| Keywords: | vehicle routing & scheduling |
Vehicle Routing Problems (VRP) under static conditions have been studied for well over four decades. The rapid advances in technology and the present market dynamics have now made it imperative for the dynamic version of the VRP to be addressed. This paper considers the dynamic version of the Pickup-and-Delivery Travelling Salesman Problem (PDTSP). Express couriers, dial-a-ride systems, and partial-truck-load carriers are examples of this class of the Travelling Salesman Problem (TSP). Here, we model the single vehicle problem as a PDTSP. We propose two heuristics with different approaches for solving the dynamic subproblem online.