Michael D. Peterson

Learn More
We develop and test several heuristics for two well-known vehicle routing problems which have stochastic demand: the probabilistic traveling salesman problem (PTSP) and the prob-abilistic vehicle routing problem (PVRP). The goal in these problems is to obtain optimal a priori tours, that is, tours which are designed before demands are known. We develop a(More)
We develop and test several heuristics for two well-known vehicle routing problems which have stochastic demand: the probabilistic traveling salesman problem (PTSP) and the prob-abilistic vehicle routing problem (PVRP). The goal in these problems is to obtain optimal a priori tours, that is, tours which are designed before demands are known. We develop a(More)
  • 1