Comparative study of various models addressing the problem of transport on demand;Étude comparative de divers modèles pour le problème de transport à la demande

INFOR

Volumn 45, Issue 2, 2007, Pages 95-110

  Paquette, Julie ^a,b   Cordeau, Jean François ^a,b   Laporte, Gilbert ^a,b  

^a HEC MONTRÉAL   (Canada)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 46749133112     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.3138/infor.45.2.005     Document Type: Article

References (36)

1. Aldaihani, M. et Dessouky, M.M. (2003) Hybrid scheduling methods for paratransit operations. Computers & Industrial Engineering, 45: 75-96.
2. Borndörfer, R., Grötschel, M., Klostermeier, F., et Küttner, C. (1997) Telebus Berlin : Vehicle scheduling in a dial-a-ride system. Technical report SC 97-23; Konrad-Zuse- Zentrum fur Informationstechnik: Berlin.
3. Coello Coello, C, et Romero, C. (2002) Evolutionary algorithms and multiple objective optimization. In: Ehrgott, M., et Gandibleux, X. (eds.) Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys; Kluwer: Boston, pp. 277-332.
4. Colorni, A. et Righini, G. (2001) Modeling and optimizing dynamic dial-a-ride problems. International Transactions in Operational Research, 8: 155-166.
5. Cordeau, J.-F. (2006) A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54: 573-586.
6. Cordeau, J.-F. et Laporte, G. (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B, 37: 579-594.
7. Cordeau, J.-F. et Laporte, G. (2007) The dial-a-ride problem: models and algorithms. Annals of Operations Research, 153: 29-46.
8. Cordeau, J.-F., Laporte, G., Potvin, J.-Y., et Savelsbergh, M.W.P. (2007) Transportation on demand. In: Barnhart, C. et Laporte, G. (eds.) Handbooks in Operations Research and Management Science; Elsevier: Amsterdam. Volume 14, pp. 429-466.
9. Coslovich, L., Pesenti, R., et Ukovich, W. (2006) A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175: 1605-1615.
10. Cullen, F.H., Jarvis, J.J., et Ratcliff, H.D. (1981) Set partitioning based heuristics for interactive routing. Networks, 11: 125-143.
11. Dessouky, M.M., Rahimi, M., et Weidner, M. (2003) Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling. Transportation Research Part D, 8: 433-465.
12. Diana, M. et Dessouky, M.M. (2004) A new regret insertion heuristic for solving largescale dial-a-ride problems with time windows. Transportation Research Part B, 38: 539-557.
13. Dumas, Y., Soumis, F., et Desrosiers, J. (1990) Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transportation Science, 24: 145-152.
14. Eiselt, H.A. et et Laporte G. (1995) Objectives in location problems Drezner Z. (ed.), Facility Location : A survey of applications and methods, Springer: New York, pp. 151-180.
15. Fleischmann, B., Gnutzmann, S., et Sandvoss, E. (2004) Dynamic vehicle routing based on online traffic information. Transportation Science, 38: 420-433.
16. Horn, M.E.T. (2002) Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research Part C, 10: 35-63.
17. Jaw, J.-J. (1984) Solving large-scale dial-a-ride vehicle routing and scheduling problems. Thèse de Ph.D., Department of Aeronautics and Astronautics, Massachusetts Institute of Technology: Cambridge, MA., 224p.
18. Jaw, J.-J., Odoni, A.R., Psaraftis, H.N., et Wilson, N.H.M. (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transporation Research Part B, 20B: 243-257.
19. Jones, D.F. et Tamiz, M. (2002) Goal programming in the period 1990-2000. In: Ehrgott, M. et Gandibleux, X. (eds.), Multiple criteria optimization : State of the art annotated bibliographic surveys; Kluwer: Boston, pp. 128-170.
20. Jorgensen, R.M., Larsen, J., et Bergvinsdottir, K.B. (2007) Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society, 38: 1321-1331.
21. Madsen, O.B.G., Ravn, H.F., et 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.
22. Melachrinoudis, E., Ilhan, A.B., et Min, H. (2007) A dial-a-ride problem for client transportation in a health-care organization. Computers & Operations Research, 34: 742-759.
23. Psaraftis, H.N. (1983) An exact algorithm for the single vehicle many-to-many dial a- ride problem with time windows. Transporation Science, 17: 351-357.
24. Psaraftis, H.N. et Tharakan, G.G. (1979) A dynamic programming approach to the dial-a-ride problem : An extension to the multivehicle case. Document de travail R79-39, Department of Civil Engineering, Massachusetts Institute of Technology: Cambridge, MA., 60p.
25. Rawls, J. (1971) Theory of Justice. Harvard University Press: Cambridge, MA.
26. Roy, S., Rousseau, J.-M., Lapalme, G., et Ferland, J.A. (1985) Élaboration des routes et horaires de véhicules pour le transport adapté : l'algorithme. Document de travail, Université de : Montreal : Centre de recherche sur les transports, 21p.
27. Savelsbergh, M.W.P. (1992) The vehicle routing problem with time windows : minimizing route duration. ORSA Journal on Computing, 4: 146-154.
28. Sexton, T.R. et Bodin, L.D. (1985) Optimizing single vehicle many-to-many operations with desired delivery times. Transporation Science, 19: 378-410.
29. Sexton, T.R. et Choi, Y.-M. (1986) Pickup and delivery of partial loads whit soft time windows. American Journal of Mathematical and Management Sciences, 6: 369-398.
30. Stein, D. (1978) Scheduling dial-a-ride transportation systems. Transportation Science, 12: 232-249.
31. Toth, P. et Vigo, D. (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman, I.H. et Kelly, J.P. (eds.), Meta-Heuristics : Theory and Applications, Kluwer: Boston, pp. 677-690.
32. Toth, P. et Vigo, D. (1997) Heuristic algorithms for the handicapped persons transportation problem. Transportation science, 31: 60-71.
33. Wilson, N.H.M., Weissberg, R.W., et Hauser, J. (1976) Advanced dial-a-ride algorithms research project : Final report. Document de travail R-76-20, Department of Civil Engineering, Massachusetts Institute of Technology: Cambridge, MA., 124p.
34. Wolfler Calvo, R. et Colorni, A. (2007) An effective and fast heuristic for the dial-a-ride problem. 40R : A Quarterly Journal of Operations Research, 5: 61-73.
35. Wong, K.I. et Bell, M.G.H. (2006 Solution of the dial-a-ride problem with multidimensional capacity constraints. International Transactions in Operational Research, 13: 195-208.
36. Xiang, Z., Chu, C, et Chen, H. (2006 A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research, 174: 1117-1139.