We derive the worst-case demand distributions for the vehicle routing problem.
When vehicles face time window constraints, there are two worst-case distributions.
We study the trade-off between two kinds of routing costs, “radial” and “circular”.
We conduct numerical simulations that use our result to solve a practical problem.