The mixed capacitated general routing problem under uncertainty
Probabilistically constrained formulation. Deterministic formulation where uncertain parameters follow a normal distribution. Branch-and-cut algorithm and an efficient heuristic algorithm.
routing problem mixed graph neighborhood search probabilistic constraints