Vehicle Routing Problem

KS441RV6WMZJKLG19Y4J

The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". It generalises the well-known travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John Ramser in 1959, in which the first algorithmic approach was written and was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. The objective of the VRP is to minimize the total route cost. In 1964, Clarke and Wright improved on Dantzig and Ramser's approach using an effective greedy approach called the savings algorithm.

Read more on Wikipedia

Have feedback on this skill? Let us know.

pattern

Job Postings Data

Top Companies Posting

Job Postings Analytics Loading Spinner

Top Job Titles

Job Postings Analytics Loading Spinner

Job Postings Trend

Job Postings Analytics Loading Spinner

Live Job Postings

Job Postings Analytics Loading Spinner