Feasibility Testing for Dial-a-Ride Problems
Hunsaker and Savelsbergh have proposed an algorithm for testing feasibility of a route in the solution to the dial-a-ride problem. The constraints that are checked are load capacity constraints, time windows, ride time bounds and wait time bounds. The algorithm has linear running time. By virtue of a simple example, we show in this work that their algorithm is incorrect. We also prove that by increasing the time complexity by only a logarithmic factor, a correct algorithm is obtained.
Keywordsdial-a-ride problem feasibility algorithm
Unable to display preview. Download preview PDF.
- 3.Borndörfer, R., Grötschel, M., Klostermeier, F., Küttner, C.: Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin (1997)Google Scholar
- 6.Cordeau, J.-F., Laporte, G., Potvin, J.Y., Savelsbergh, M.W.P.: Transportation on demand. In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbook in OR & MS, vol. 14, pp. 429–466. Elsevier, Amsterdam (2007)Google Scholar