A note on “Efficient feasibility testing for dial-a-ride problems” |
| |
| Authors: | Jiafu Tang Yuan Kong Andrew WH Ip |
| |
| Institution: | a Department of Systems Engineering, Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang 110004, Chinab Department of Industrial & Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| |
| 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(n2) worst-case time. |
| |
| Keywords: | Dial-a-ride problems Feasibility Ride time constraints |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
