Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies

European Journal of Operational Research

Volumn 151, Issue 1, 2003, Pages 1-11

  Ghiani, Gianpaolo ^a   Guerriero, Francesca ^b   Laporte, Gilbert ^c   Musmanno, Roberto ^b  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

^c HEC MONTRÉAL   (Canada)

Author keywords

Metaheuristics; Parallel computing; Routing

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS; VEHICLES;

VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 0042591567     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00915-3     Document Type: Article

References (48)

1. P. Toth, D. Vigo (Eds.), The Vehicle Routing Problem, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002.
2. Brown G.G., Graves G.W. Real-time dispatch of petroleum tank trucks. Management Science. 27:1981;19-32.
3. Brown G.G., Ellis C., Graves G.W., Ronen D. Real-time, wide area dispatching of Mobil tank trucks. Interfaces. 17(1):1987;107-120.
4. Powell W.B. A stochastic model of the dynamic vehicle allocation problem. Transportation Science. 20:1986;117-129.
5. Goetschalckx M. A decision support system for dynamic truck dipatching. International Journal of Physical Distribution and Materials Management. 14:1988;34-42.
6. Powell W.B. Real-time optimization for truckload motor carriers. OR/MS Today. 18:1990;28-33.
7. Rego C., Roucairol C. Using tabu search for solving a dynamic multi-terminal truck dispatching problem. European Journal of Operational Research. 83:1995;411-429.
8. Savelsbergh M.W.P., Sol M. Drive: Dynamic routing of independent vehicles. Operations Research. 46:1998;474-490.
9. Campbell A., Clarke L., Kleywegt A., Savelsbergh M. The inventory routing problem. Laporte G., Crainic T.G. Fleet Management and Logistics. 1998;Kluwer, Boston.
10. A. Larsen, The dynamic vehicle routing problem, Ph.D. Thesis, Institute of Mathematical Modelling, Technical University of Denmark, 2001.
11. Gendreau M., Guertin F., Potvin J.-Y., Taillard É. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science. 33:1999;381-390.
12. M. Gendreau, F. Guertin, J.-Y. Potvin, R. Séguin, Neighbourhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries, Technical report CRT-98-10, Centre de Recherche sur les Transports, Université de Montréal, 1998.
13. J.-F. Cordeau, G. Ghiani, G. Laporte, R. Musmanno, A parallel tabu search algorithm for the static dial-a-ride problem, working paper, 2002.
14. Madsen O.B.G., Tosti K., Vælds J. A heuristic method for dispatching repair men. Annals of Operations Research. 61:1995;213-226.
15. Weintraub A., Aboud J., Fernandez C., Laporte G., Ramirez E. An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society. 50:1999;690-696.
16. Brotcorne L., Laporte G., Semet F. Ambulance location and relocation models. European Journal of Operational Research. 147(3):2003;451-463.
17. J.F. Cordeau, G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Technical Report, May, 2002.
18. S. Roy, J.-M. Rousseau, G. Lapalme, J.A. Ferland, Routing and scheduling of transportation services for disabled: Summary report, Technical Report, Centre de Recherche sur les Transports, Université de Montréal, 1984.
19. Madsen O.B.G., Ravn H.F., Rygaard J.M. A heuristic algorithm for a dial-ride problem with time windows. Annals of Operations Research. 60:1995;193-208.
20. Psaraftis H.N. A dynamic programming solution to the single many-to-many immediate request dial-a-ride problem. Transportation Science. 14:1980;130-154.
21. Gendreau M., Laporte G., Semet F. Solving an ambulance location model by tabu search. Location Science. 2:1997;75-88.
22. Gendreau M., Laporte G., Semet F. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Computing. 27:2001;1641-1653.
23. Laporte G., Louveaux F.V. Solving stochastic routing problems. Crainic T.G., Laporte G. Fleet Management and Logistics. 1998;159-167 Kluwer, Boston.
24. Powell W.B., Jaillet P., Odoni A.R. Stochastic and dynamic networks and routing. Ball M.O., Magnanti T.L., Monma C.L., Nemhauser G.L. Handbooks in Operations Research and Management Science, 8: Network Routing. 1995;141-295 Elsevier Science, Amsterdam.
25. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, F. Soumis, The vehicle routing problem with time windows, in: P. Toth, D. Vigo (Eds.), The Vehicle Routing Problem, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2001, pp. 157-193.
26. Malandraki C., Daskin M.S. Time dependent vehicle routing problems: Formulations, properties, and heuristics algorithms. Transportation Science. 26:1992;185-200.
27. Bertsimas D., van Ryzin G.J. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research. 39:1991;601-615.
28. Psaraftis H.N. Dynamic vehicle routing problems. Golden B.L., Assad A.A. Vehicle Routing: Methods and Studies. 1998;223-248 Elsevier Science, Amsterdam.
29. Gendreau M., Potvin J.-Y. Dynamic vehicle routing and dispatching. Crainic T.G., Laporte G. Fleet Management and Logistics. 1998;115-126 Kluwer, Boston.
30. Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Science. 34:2000;426-435.
31. Psaraftis H.N. Dynamic vehicle routing: Status and prospects. Annals of Operations Research. 61:1995;143-164.
32. K. Lund, O.B.G. Madsen, J.M. Rygaard, Vehicle routing problems with varying degrees of dynamism, Technical report, Institute of Mathematical Modelling, Technical University of Denmark, 1996.
33. A. Larsen, O.B.G. Madsen, M.M. Solomon, Partially dynamic vehicle routing - models and algorithms, Technical report, Institute of Mathematical Modelling, Technical University of Denmark, 1999.
34. Potvin J.-Y., Shen Y., Rousseau J.-M. Neural networks for automated vehicle dispatching. Computers & Operations Research. 19:1992;267-276.
35. Potvin J.-Y., Dufour G., Rousseau J.-M. Learning vehicle dispatching with linear programming models. Computers & Operations Research. 20:1993;371-380.
36. Bertsimas D., van Ryzin G.J. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles. Operations Research. 41:1993;60-76.
37. Swihart M.R., 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.
38. Papastavrou J. A stochatic and dynamic routing policy using branching processes with state dependent immigration. European Journal of Operational Research. 95:1996;167-177.
39. S. Mitrović-Minić, R. Krishnamurti, G. Laporte, The double-horizon heuristic for the dynamic pickup and delivery problem with time windows, submitted for publication.
40. Osman I.H., Kelly J.P. Meta-heuristics: Theory and Applications. 1996;Kluwer, Boston.
41. Shen Y., Potvin J.-Y., Rousseau J.-M., Roy S. A computer assistant for vehicle dispatching with learning capacities. Annals of Operations Research. 61:1995;189-211.
42. Bagchi P.K., Nag B.N. Dynamic vehicle scheduling: An expert systems approach. International Journal of Physical Distribution and Logistics Management. 21:1991;10-18.
43. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research. 5:1986;533-549.
44. Rochat Y., Taillard É. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
45. Mladenović N., Hansen P. Variable neighbourhood search. Computers & Operations Research. 24:1997;1097-1100.
46. Crainic T.G., Toulouse M., Gendreau M. Towards a taxonomy of parallel tabu search algorithm. INFORMS Journal on Computing. 9:1997;61-72.
47. Buyya R. High Performance Cluster Computing: Architectures and Systems. vols. 1 and 2:1999;Prentice-Hall, Englewood Cliffs, NJ.
48. P. Caricato, G. Ghiani, A. Grieco, E. Guerriero, Parallel tabu search for a vehicle rounting problem under track contention, Parallel Computing, forthcoming.