Abstract
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.
This work was supported by the Norwegian Research Council, Gassco and Statoil under contract 175967/S30.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Madsen, O.B., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Annals of Operations Research 60(1-4), 193–208 (1995)
Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M.M., Villeneuve, D.: A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 29(1), 63–78 (1995)
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)
Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31(1), 60–71 (1997)
Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153(1), 29–46 (2007)
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)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58(2), 81–117 (2008)
Hunsaker, B., Savelsbergh, M.: Efficient feasibility testing for dial-a-ride problems. Operations Research Letters 30(3), 169–173 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haugland, D., Ho, S.C. (2010). Feasibility Testing for Dial-a-Ride Problems. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)