Article ID: | iaor20112528 |
Volume: | 62 |
Issue: | 4 |
Start Page Number: | 742 |
End Page Number: | 749 |
Publication Date: | Apr 2011 |
Journal: | Journal of the Operational Research Society |
Authors: | Eglese R, Mu Q, Fu Z, Lysgaard J |
Keywords: | heuristics: tabu search |
This paper introduces a new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan. The paper then focuses on one type of such problem, in which a vehicle breaks down during the delivery and a new routing solution needs to be quickly generated to minimise the costs. Two Tabu Search algorithms are developed to solve the problem and are assessed in relation to an exact algorithm. A set of test problems has been generated and computational results from experiments using the heuristic algorithms are presented.