Feasibility Testing for Dial-a-Ride Problems

  • Dag Haugland
  • Sin C. Ho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)


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.


dial-a-ride problem feasibility algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)zbMATHCrossRefGoogle Scholar
  2. 2.
    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)zbMATHCrossRefGoogle Scholar
  3. 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
  4. 4.
    Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31(1), 60–71 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153(1), 29–46 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 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
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Hunsaker, B., Savelsbergh, M.: Efficient feasibility testing for dial-a-ride problems. Operations Research Letters 30(3), 169–173 (2002)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dag Haugland
    • 1
  • Sin C. Ho
    • 2
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.CORAL, Department of Business Studies, Aarhus School of BusinessAarhus UniversityÅrhusDenmark

Personalised recommendations