Stochastic optimization of multi-capacitated vehicle routing problem with pickup and delivery using saving matrix algorithm

The Multi-Capacitated Problem is an optimization problem. To reduce the overall distance, the optimization problem seeks out vehicle routes that connect every customer to a storage facility. This article uses a saving matrix approach to propose an extended Vehicle Routing Problem that considers a stochastic environment and multiple capacitors. Stochastic customers are an essential element of the problem. A computational analysis also supports the suggested approach to obtain the best route.