Study Of VRP And Algorithm Of Manufacturing Network Flow

The vehicle routing problem (VRP) is the problem of designing a minimum cost set of routes for a fleet delivery (pickup) vehicles of fixed capacity. The routes must be designed so that (i) each demand location is served by exactly one vehicle, (ii) the total demand on each route is less than or equal to the capacity of the vehicle assigned to that route, and (iii) each route begins and ends at the central. The algorithm for VRP is very valuable in the respects of dispatching large quantity goods and assignment tasks for labors. Stochastic vehicle routing problems arise whenever some elements of the problem are random. Common examples are stochastic demands and stochastic travel times. Sometimes the set of customers to be visited is not known with certainty. In such a case each customer has a probability pt of being present. Manufacturing networkflow problem is applied widely in the distribution of the source of water and the transit of products that have some process of synthesis of different materials to one products and/or the distilling of one material to many different products.In this paper, first, I present a new model of VRP and a heuristic algorithm of it. Then, I have proofed that on the distance constrained VRP, any polynomial timeheuristic H for MV, we have KH /Kv >2; and I give a dynamic programmingrecursion heuristic of MD. Furthermore, I study some stochastic vehicle routing problem also. I give a tabu algorithm of stochastic demand of VRP, and I present a best way that a vehicle travels. At last, I present an algorithm of maximum manufacturing network flow.