ANWB Automates and Improves Service Personnel Dispatching

Published Online:https://doi.org/10.1287/inte.1100.0545

References

  • ANWB Klanttevredenheidsonderzoek, Kwartaalrapportage. (2003) . Report, ANWB, The Hague, The NetherlandsGoogle Scholar
  • Balas E. The prize collecting traveling salesman problem. Networks (1989) 19(6):621–636CrossrefGoogle Scholar
  • Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the plane with multiple capacitated vehicles. Oper. Res. (1991) 41(1):60–76LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
  • Gendreau M., Potvin J.-Y., Crainic T. G., Laporte G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Norwell, MA) 115–126CrossrefGoogle Scholar
  • Hiller B., Krumke S. O., Rambau J. Reoptimization gaps versus error models in online-dispatching of service units for ADAC. Discrete Appl. Math. (2006) 154(13):1897–1907CrossrefGoogle Scholar
  • Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34(4):426–438LinkGoogle Scholar
  • Irani S., Lu X., Regan A. On-line algorithms for the dynamic traveling repair problem. J. Scheduling (2004) 7(3):243–258CrossrefGoogle Scholar
  • Krumke S. O., Rambau J., Torres L. M. Real-time dispatching of guided and unguided automobile service units with soft time windows. (2002) . Accessed October 5, 2010, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.84.5906&rep=rep1&type=pdfGoogle Scholar
  • Krumke S. O., Saliba S., Vredeveld T., Westphal S. Approximation algorithms for a vehicle routing problem. Math. Methods Oper. Res. (2008) 68(2):333–359CrossrefGoogle Scholar
  • van de Klundert J., Wormer L. ASAP: The after-salesman problem. Manufacturing Service Oper. Management (2010) 12(4):627–641LinkGoogle Scholar
  • Wormer L. On line assignment of car repair services. (2005) . Master's thesis, Universiteit Maastricht, Maastricht, The NetherlandsGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.