Efficient feasibility testing for dial-a-ride problems

Operations Research Letters

Volumn 30, Issue 3, 2002, Pages 169-173

  Hunsaker, Brady ^a   Savelsbergh, Martin ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING; SCHEDULING; VEHICLES;

DIAL-A-RIDE SYSTEMS;

OPERATIONS RESEARCH;

EID: 0036601337     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00120-7     Document Type: Article

References (10)

1. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows
2. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
3. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem
4. 2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem
5. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows
6. k-interchange procedures for local search in a precedence-constrained routing problem
7. Scheduling large-scale advance-request dial-a-ride systems
8. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling
9. Optimizing single vehicle many-to-many operations with desired delivery times: Ii. Routing
10. Scheduling dial-a-ride transportation systems