Genetic algorithms for vehicle dispatching

International Transactions in Operational Research

Volumn 4, Issue 5-6, 1997, Pages 391-400

  Leclerc, F ^a   Potvin, J Y ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Courier service; Genetic algorithms; Utility function; Vehicle dispatching

Indexed keywords

EID: 85040491885     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1997.tb00094.x     Document Type: Article

References (29)

1. Bagchi, P. K. and Nag, B. N. (1991) Dynamic vehicle scheduling: An expert systems approach. International Journal of Physical Distribution and Logistics, 21, 10-18.
2. Baker, J. E. (1987) Reducing bias and inefficiency in the selection algorithm. Proc. Second Int. Conf: On Genetic Algorithms, pp. 14-21.
3. Bell, W., Dalberto, L. M., Fisher, M.L., Greenfield, A.J., Jaikumar, R., Kedia, P., Mack, R.G. and Prutzman, P.J. (1983) Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces, 13, 4-23.
4. Bertsimas, D. J. and Van Ryzin, G. (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane: Operations Research, 39, 601-615.
5. Bertsimas, D.J. and Van Ryzin, G. (1993) Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles: Operations Research, 41, 60-76.
6. Bodin, L., Golden, B. L., Assad, A. A. and Ball, M. (1983) Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research, 10, 63-211.
7. Brown, G.G. and Graves, G.W. (1983) Real-time dispatch of petroleum tank trucks. Management Science, 31, 764-772.
8. Brown, G. G., Ellis, C. J., Graves, G. W. and Ronen, D. (1987) Real-time wide area dispatching of Mobil tank trucks. Interfaces, 17, 107-120.
9. Crainic, T. G., Gendreau, M. and Dejax, P. (1993) Dynamic and stochastic models for the allocation of empty containers: Operations Research, 41, 102-126.
10. Frantzeskakis, L. F. and Powell, W. B. (1990) A successive approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Science, 24, 40-57.
11. Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W. (1993) A variational inequality formulation of the dynamic network user equilibrium problem: Operations Research, 41, 179-191.
12. Fujiwara, O., Makjamroen, T. and Gupta, K. K. (1987) Ambulance deployment analysis: A case study of Bangkok. European Journal of Operational Research, 31, 9-18.
13. Koza, J. R. (1992) Genetic Programming: On The Programming of Computers by Means of Natural Selection. The MIT Press, Cambridge.
14. Leclerc, F. and Potvin, J. Y. (1995) A fitness scaling method based on a span measure. Proc: Of the IEEE Int. Conf: On Evolutionary Computation, pp. 11-561-565.
15. Michalewicz, Z. (1994) Genetic Algorithms + Data Structures = Evolution Programs, 2nd edn. Springer-Verlag, Berlin.
16. Minkoff, A. S. (1993) A Markov decision model and decomposition heuristic for dynamic vehicle dispatching: Operations Research, 41, 77-90.
17. Powell, W. B. (1988) A comparative review of alternative algorithms for the dynamic vehicle allocation problem. In Vehicle Routing: Methods and Studies, eds Golden and Assad, pp. 249-291. North-Holland, Amsterdam.
18. Psaraftis, H.N. (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 2, 130-154.
19. Psaraftis, H. N. (1988) Dynamic vehicle routing problems. In Vehicle Routing: Methods and Studies, eds Golden and Assad, pp. 223-248. North-Holland, Amsterdam.
20. Psaraftis, H.N. (1995) Dynamic vehicle routing: Status and prospects. Annals of Operations Research, 61, 143-164.
21. Psaraftis, H. N. and Tsitsiklis, J. N. (1993) Dynamic shortest paths in acyclic networks with markovian arc costs: Operations Research, 41, 91-101.
22. Ran, B., Boyce, D. E. and LeBlanc, L. J. (1993) A new class of instantaneous dynamic user-optimal traffic assignment models: Operations Research, 41, 191-202.
23. Sauder, R.L. and Westerman, W. M. (1983) Computer-aided train dispatching: decision support through optimization. Interfaces, 13, 24-37.
24. Shen, Y., Potvin, J.Y. and Rousseau, J. M. (1995) A computer assistant for vehicle dispatching with learning capabilities. Annals of Operations Research, 61, 189-211.
25. Syswerda, G. (1989) Uniform crossover in genetic algorithms. Proc. Third Int. Conf: On Genetic Algorithms, pp. 2-9.
26. Trudeau, P., Rousseau, J. M., Ferland, J. A. and Choquette, J. (1989) An operations research approach for the planning and operation of an ambulance service. INFOR, 27, 95-113.
27. Whitely, D. (1989) The Genitor algorithm and selection pressure: why rank-based allocation of reproductive trials is best. Proc. Third Int. Conf: On Genetic Algorithms, pp. 116-121.
28. Wilson, N. H. M. and Colvin, N. H. (1977) Computer control of the Rochester dial-a-ride system. Technical Report R-77-30, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA.
29. Wilson, N.H. M., Sussman, J.M., Wang, H.K. and Higonett, B.T. (1971) Scheduling algorithms for dial-a-ride systems. Technical Report USL-TR-70-13, Urban Systems Laboratory, Massachusetts Institute of Technology, Cambridge, MA USA.