A note on "Efficient feasibility testing for dial-a-ride problems"

  • Authors:

  • Jiafu Tang;Yuan Kong;Henry Lau;Andrew W. H. Ip

  • Affiliations:

  • Department of Systems Engineering, Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang 110004, China;Department of Systems Engineering, Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang 110004, China;Department of Industrial & Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Industrial & Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

  • Venue:
  • Operations Research Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hunsaker and Savelsbergh [B. Hunsaker, M.W.P. Savelsbergh, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters 30 (2002) 169-173.] developed a linear-time algorithm to verify the feasibility for dial-a-ride problems. However, this algorithm may incorrectly declare infeasibility due to ride time constraints in some cases. We propose a revised procedure to address this flaw, but in an O(n^2) worst-case time.