Login / Signup

A 2-stage method for a field service routing problem with stochastic travel and service times.

S. BinartPierre DejaxMichel GendreauFrédéric Semet
Published in: Comput. Oper. Res. (2016)
Keyphrases
  • routing problem
  • cost function
  • service times
  • dynamic programming
  • real time
  • objective function
  • search algorithm
  • single server