| Article ID: | iaor19981482 |
| Country: | Netherlands |
| Volume: | 83 |
| Issue: | 1 |
| Start Page Number: | 83 |
| End Page Number: | 104 |
| Publication Date: | May 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Moll Robert, Healy Patrick |
| Keywords: | heuristics |
In this paper we propose a cheap yet effective extension to the traditional local improvement algorithm. We present this extension in the context of the Dial-A-Ride Problem, a variant of the Traveling Salesman Problem. This extension, which we call sacrificing, yields significant improvements over its plain local improvement counterpart without adversely affecting the algorithm's running time.