The vehicle routing problem vehicle routing problem, VRP in remainder of this paper is a combinatorial optimisation problem and operational research. It belongs to the category of transportation problems, as the travelling salesman problem travelling salesman problem, TSP and the chance-constrained programming CCP. These problems in the field of logistics, one or more vehicles must cover transportation network to deliver goods to customers or cover the roads network. Solving the problem is to determine a set of tours that minimise the best targets as the total distance travelled, the number of vehicles used, the sum of the delays of customers, i.e. this article describes a new algorithm for solving transportation problems with modified boundary conditions to minimise the uncertainty in the travel parameters, where a gain is associated with each customer and where the objective is to maximise the total gain collected and minimise the routing costs.