The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments

European Journal of Operational Research

Volumn 185, Issue 2, 2008, Pages 534-551

  Xiang, Zhihai ^a   Chu, Chengbin ^a   Chen, Haoxun ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Dynamic dial a ride problem; Heuristics; Stochastic; Time dependent; Transportation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; SCHEDULING; TIME AND MOTION STUDY; TRAFFIC CONTROL;

DYNAMIC DIAL RIDE PROBLEM; TRAFFIC JAM; TRAVELLING TIME FLUCTUATION; VEHICLE BREAKDOWN;

PROBLEM SOLVING;

EID: 34548819012     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.007     Document Type: Article

References (28)

1. Attanasio A., Cordeau J.F., Ghiani G., and Laporte G. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30 (2004) 377-387
2. Banks J., Carson II J.S., Nelson B.L., and Nicol D.M. Discrete-Event System Simulation (2001), Prentice-Hall, New Jersey (Chapter 3)
3. Borndörfer, R., Grötschel, M., Klostermeier, F., Küttner, C., 1997. Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
4. Cordeau, J.F., Laporte G., 2002. The dial-a-ride problem: Variants, modeling issues and algorithms, Technical Report ISSN: 0711-2440, Les Cahiers du GERAD, Montréal.
5. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2002. VRP with pickup and delivery. In: Toth, P., Vigo, D. (Eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelpia, pp. 225-242.
6. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
7. Feuerstein E., and Stougie L. On-line single-server dial-a-ride problems. Theoretical Computer Science 268 (2001) 91-105
8. Fu, L., 1999. Improving Paratransit Scheduling by Accounting for Dynamic and Stochastic Variations in Travel Time, Transportation Research Record 1666, Transportation Research Board.
9. Fu L. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transportation Research - Part B 36 (2002) 485-506
10. Fu L. A simulation model for evaluating advanced dial-a-ride paratransit systems. Transportation Research - Part A 36 (2002) 291-307
11. Gendreau M., Laporte G., and Séguin R. Stochastic vehicle routing. European Journal of Operational Research 88 (1995) 3-12
12. Gendreau M., Guertin F., Potvin J.Y., and Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33 (1999) 381-390
13. Ghiani G., Guerriero F., Laporte G., and Musmanno R. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research 151 (2003) 1-11
14. Grötschel, M., Krumke, S.O., Rambau, J., Winter, T., Zimmermann, U., 2001. Combinatorial Online Optimization in Real Time. Technical Report ZIB 01-16, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
15. Healy P., and Moll R. A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research 83 (1995) 83-104
16. Ichoua S., Gendreau M., and Potvin J.Y. Diversion issues in real-time vehicle dispatching. Transportation Science 34 (2000) 426-438
17. Ichoua S., Gendreau M., and Potvin J.Y. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144 (2003) 379-396
18. Jaw J., Odoni A.R., Psaraftis H.N., and Wilson N.H.M. A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Research B 20 (1986) 243-257
19. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International transactions in operational research 7 (2000) 285-300
20. Lin S. Computer solutions of the travelling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
21. Madsen O.B.G., Ravn H.F., and 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 (1995) 193-208
22. Mitrović-Minić S., Krishnamurti R., and Laporte G. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research - Part B 38 (2004) 669-685
23. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
24. Psaraftis H.N. Dynamic vehicle routing problems. In: Golden B.L., and Assad A.A. (Eds). Vehicle Routing: Methods and Studies (1988), Elsevier Science, Amsterdam 223-248
25. Swihart M.R., and Papastavrou J.D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research 114 (1999) 447-464
26. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31 (1997) 60-71
27. Van Breedam A. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research 28 (2001) 289-315
28. Xiang Z.H., Chu C.B., and Chen H.X. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research 174 (2007) 1117-1139