%0 Journal Article
%T RECENT TRENDS IN LINEAR PROGRAMMING: VEHICLE ROUTING PROBLEM
%J Int. J. of Aquatic Science
%I
%Z 2008-8019
%A .S, Mrs.Amali Theresa
%A GowriManohari, Mrs.M.
%D 2020
%\ 05/01/2020
%V 11
%N 1
%P 503-508
%! RECENT TRENDS IN LINEAR PROGRAMMING: VEHICLE ROUTING PROBLEM
%K vehicle routing problem
%K heuristic
%K The Clarke and Wright algorithm
%K Approximation algorithms
%R
%X In this paper we discuss the Vehicle Routing Problem (VRP), the goal is to find optimal routes formultiple vehicles visiting a set of locations. We mean by "optimal routes" for a Vehicle RoutingProblem is the routes with the least total distance. However, if there are no other constraints, theoptimal solution is to assign just one vehicle to visit all locations, and find the shortest route for thatvehicle. This is essentially the same problem as the Transportation Salesmen Problem. A better way todefine optimal routes is to minimize the length of the longest single route among all vehicles. This isthe right definition if the goal is to complete all deliveries as soon as possible. The Vehicle RoutingProblem finds optimal routes defined.Also in this paper we discuss,why is it a challenge to solve theVehicle Routing Problem?
%U https://www.journal-aquaticscience.com/article_149779_8cd410289b05ca8a64cfcd1788500858.pdf