Annals of Operations Research

, Volume 61, Issue 1, pp 189–211 | Cite as

A computer assistant for vehicle dispatching with learning capabilities

  • Yu Shen
  • Jean-Yves Potvin
  • Jean-Marc Rousseau
  • Serge Roy


In this paper, we describe an expert consulting system for a dispatcher working in a courier service company. The system integrates interactive-graphic features and a learning module to support the dispatcher in his(her) task, and to suggest appropriate decisions when new requests come in. An experiment with a professional dispatcher is also reported.


Dispatch Service Company Computer Assistant Learning Capability Courier Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. Bell, L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Mack and P.J. Prutzman, Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces 13(1983)4–23.Google Scholar
  2. [2]
    L.D. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Computers and Operations Research 10(1983)63–211.CrossRefGoogle Scholar
  3. [3]
    J. Braklow, W. Graham, S. Hassler, K. Peck and W.B. Powell, Interactive optimization improves service and performance for Yellow freight system, Interfaces 22(1992)147–172.Google Scholar
  4. [4]
    G. Brown, C. Ellis, G. Graves and D. Ronen, Real-time, wide area dispatch of mobil tank trucks, Interfaces 17(1987)107–120.Google Scholar
  5. [5]
    E. Dijkstra, A note on two problems in connection with graphs, Numerical Mathematics 1(1959)269–271.CrossRefGoogle Scholar
  6. [6]
    Y. Dumas, Confection d'itinéraires pour le transport adapté, Technical Report G-89-44, Groupe d'études et de recherche en analyse des décisions, Ecole des Hautes Etudes Commerciales, Université de Montréal (1989).Google Scholar
  7. [7]
    J.J. Jaw, A.R. Odoni, H.N. Psaraftis and N.H.M. Wilson, A heuristic algorithm for the multivehicle advance request dial-a-ride problem with time windows, Transportation Research 20B(1986)243–257.Google Scholar
  8. [8]
    W.B. Powell, A comparative review of alternative algorithms for the dynamic vehicle allocation problem, in:Vehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1988) pp. 249–291.Google Scholar
  9. [9]
    W.B. Powell, Y. Sheffi, K. Nickerson, K. Butterbauch and S. Atherton, Maximizing profits for North American van lines' truckload division: A new framework for pricing and operations, Interfaces 18(1988)21–41.Google Scholar
  10. [10]
    H.N. Psaraftis, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science 2(1980)130–154.Google Scholar
  11. [11]
    H.N. Psaraftis, J.B. Orlin, D. Bienstock and P.M. Thompson, Analysis and solution algorithms of sealift routing and scheduling problems: Final report, Working Paper No. 1700-85, Sloan School of Management, MIT, Cambridge, MA (1985).Google Scholar
  12. [12]
    H.N. Psaraftis, Dynamic vehicle routing problems, in:Vehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1988) pp. 223–248.Google Scholar
  13. [13]
    D. Rumelhart and J.L. McClelland,Parallel Distributed Processing: Explorations in the Micro-Structure of Cognition, vols. 1 and 2 (MIT Press, Cambridge, MA, 1983).Google Scholar
  14. [14]
    D.E. Rumelhart, G.E. Hinton and R.J. Williams, Learning internal representations by error propagation, in:Parallel Distributed Processing: Explorations in the MicroStructure of Cognition, vol. 1 (MIT Press, Cambridge, MA, 1983) pp. 318–364.Google Scholar
  15. [15]
    P. Trudeau, J.M. Rousseau, J.A. Ferland and J. Choquette, An operations research approach for the planning and operation of an ambulance service, INFOR 27(1989)95–113.Google Scholar
  16. [16]
    N.H.M. Wilson, J.M. Sussman, H.K. Wang and B.T. Higonett, Scheduling algorithms for diala-ride systems, Technical Report USL-TR-70-13, Urban Systems Laboratory, MIT, Cambridge, MA (1971).Google Scholar
  17. [17]
    N.H.M. Wilson and N.H. Colvin, Computer Control of the Rochester dial-a-ride system, Technical Report R-77-30, Department of Civil Engineering, MIT, Cambridge, MA (1977).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Yu Shen
    • 1
  • Jean-Yves Potvin
    • 1
    • 2
  • Jean-Marc Rousseau
    • 1
    • 3
  • Serge Roy
    • 4
  1. 1.Départment d'informatique et de recherche opérationnelleUniversité de MontréalMontréalCanada
  2. 2.Centre de recherche sur les transportsUniversité de MontréalMontréalCanada
  3. 3.Giro Inc.MontréalCanada
  4. 4.Logiroute Inc.MontréalCanada

Personalised recommendations