Solution of the dial-a-ride problem with multi-dimensional capacity constraints

International Transactions in Operational Research

Volumn 13, Issue 3, 2006, Pages 195-208

  Wong, K I ^a   Bell, Michael G H ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Capacity constraints; Dial a ride; Elderly transportation

Indexed keywords

EID: 34250178130     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2006.00544.x     Document Type: Article

References (15)

1. Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G., 2004. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30, 377-387.
2. Cordeau, J.-F., Laporte, G., 2003a. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research 37B, 579-594.
3. Cordeau, J.-F., Laporte, G., 2003b. The Dial-a-Ride Problem: Variants, modeling issues and algorithms. 4OR- Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1, 89-101.
4. Diana, M., Dessouky, M.M., 2004. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research 38B, 539-557.
5. Fabri, A., Recht, P., 2005. On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Bin press.
6. Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M.M., Villeneuve, D., 1995. A request clustering algorithm for door to door handicapped transportation. Transportation Science 29, 63-78.
7. Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M., 1986. A heuristic algorithm for the multi-vehicle many to many advance request dial-a-ride problem. Transportation Research 20B, 243-257.
8. Madsen, O.B.G., Raven, H.F., Rygaard, J.M., 1995. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60, 193-208.
9. Mitrovic-Minic, S., Krishnamurti, R., Laporte, G., 2004. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research 38B, 669-685.
10. Psaraftis, H.N., 1980. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14, 130-154.
11. Psaraftis, H.N., 1983. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17, 351-357.
12. Sexton, T.R., Bodin, L.D., 1985a. Optimizing single vehicle many-to-many operations with desired delivery times: 1. Scheduling. Transportation Science 19, 378-410.
13. Sexton, T.R., Bodin, L.D., 1985b. Optimizing single vehicle many-to-many operations with desired delivery times: 2. Routing. Transportation Science 19, 411-435.
14. Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research 35, 254-265.
15. Toth, P., Vigo, D., 1997. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31, 60-71.