A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

European Journal of Operational Research

Volumn 174, Issue 2, 2006, Pages 1117-1139

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

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b HEFEI UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Dial a ride problem; Heuristics; Transportation; Vehicle routing problem

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; PERSONAL COMPUTERS; PROBLEM SOLVING; TRANSPORTATION;

COMPLEX CONSTRAINTS; DIAL-A-RIDE PROBLEM; DIVERSIFICATION STRATEGY; VEHICLE ROUTING PROBLEM;

HEURISTIC METHODS;

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

References (38)

1. Backer B., Furnon V., Shaw P., Kilby P., and Prosser P. Solving vehicle routing problem using constraint programming and metaheuristics. Journal of Heuristics 6 (2000) 501-523
2. Bodin L.D., and Sexton T. The multi-vehicle subscriber dial-a-ride problem. TIMS Studies in Management Science 26 (1986) 73-86
3. 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.
4. Cordeau J.F., and Laporte G. A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37 (2003) 579-594
5. Cordone R., and Wolfler Calvo R. A heuristic for the vehicle routing problem with time windows. Journal of Heuristics 7 (2001) 107-129
6. 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, Philadelphia, pp. 225-242.
7. Desrosiers J., Dumas Y., and Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences 6 (1986) 301-325
8. Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., Villeneuve, D., 1991. An algorithm for mini-clustering in handicapped transport. Cahier du GERAD G-91-22, Ecole des Hautes Etudes commerciales, Montréal.
9. Dorigo, M., Maniezzo, V., Colorni, A., 1991. The ant system: An autocatalytic optimizing process. Technical report No. 91-016 revised. Politecnico di Milano, Italy.
10. Dumas, Y., Desrosiers, J., Soumis, F., 1989. Large scale multi-vehicle dial-a-ride problems. Cahier du GERAD G-89-30, Ecole des Hautes Etudes commerciales, Montréal.
11. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
12. Gillett B., and Miller L. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 (1974) 340-349
13. Glover F., and Laguna M. Tabu Search (1997), Kluwer, Boston
14. 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
15. Holland J.H. Adaptation in natural and artificial systems (1975), University of Michigan Press, Ann Arbor
16. Hunsaker B., and Savelsbergh M. Efficient feasibility testing for dial-a-ride problems. Operations Research Letters 30 (2002) 169-173
17. Ioachim I., Desrosiers J., Dumas Y., and Solomon M.M. A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 29 (1995) 63-78
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. Kinderwater G.A.P., and Savelsbergh M.W.P. Vehicle routing: Handling edge exchanges. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), Wiley, Chichester 337-360
20. Kirckpatrick S., Gelatt Jr. C., and Vecchi M. Optimization by simulated annealing. Science 220 (1983) 671-680
21. 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
22. Lin S. Computer solutions of the travelling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
23. Lin S., and Kernighan B. An effective heuristic algorithm for the travelling salesman problem. Operations Research 21 (1973) 498-516
24. Or, I., 1976. Travelling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. Ph.D. dissertation, Northwestern University, Evanston, IL.
25. Nanry W.P., and Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research B 34 (2000) 107-121
26. 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
27. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many immediate request dial-a-ride problem with time windows. Transportation Science 17 (1983) 351-357
28. Psaraftis H.N. k-Interchange procedures for local search in a precedence-constrained routing problem. European Journal of Operational Research 13 (1983) 391-402
29. Roy, S., Rousseau, J.M., Lapalme, G., Ferland, J.A., 1984a. Routing and scheduling for the transportation of disabled persons-the algorithm. Technical Report TP 5596E, Centre de Recherche sur les Transports, Montréal.
30. Roy, S., Rousseau, J.M., Lapalme, G., Ferland, J.A., 1984b. Routing and scheduling for the transportation of disabled persons-the tests. Technical Report TP 5598E, Centre de Recherche sur les Transports, Montréal.
31. Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing 4 (1992) 146-154
32. Savelsbergh M.W.P., and Sol M. Drive: Dynamic routing of independent vehicles. Operations Research 46 (1998) 474-490
33. Tan K.C., Lee L.H., and Ou K. Artificial intelligence heuristics in solving vehicle routing problems with time window constraints. Engineering applications of artificial intelligence 14 (2001) 825-837
34. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31 (1997) 60-71
35. Van Breedam A. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research 28 (2001) 289-315
36. Voudouris, C., Tsang, E., 1995. Guided local search. Technical Report CSM-247, Department of Computer Science, University of Essex, Colchester, UK.
37. Wilson, H., Sussman, J., Higonnet, B., 1971. Scheduling algorithms for dial-a-ride systems. Technical Report USL TR-70-13, Urban Systems Laboratory, MIT, Boston.
38. Xu H., Chen Z.L., Rajagopal S., and Arunapuram S. Solving a practical pickup and delivery problem. Transportation Science 37 (2003) 347-367