Vehicle Routing

Step 2:  Run the Vehicle Routing algorithm applet.

VRP is a distribution problem in which trucks are based at a warehouse (depot) and are required to visit a set of customers. Each customer has a demand and a geographic location. The objective is to minimize the total distance traveled by all trucks. The sum of demands of customers served by a truck cannot exceed the truck capacity. The demand of a customer cannot be split among two or more trucks.

At the end, the algorithm displays

• Each color is a truck needed.
• The distance traveled by all trucks.

Now that you have a graph with customers and a depot, we can apply the Vehicle Routing algorithm.  Click on Solve VRP Problem: TSP algorithm to see the applet run through the algorithm.

1. Enter the truck capacity and hit return (15 was entered for this example).

For more explanation on how to use this applet, click on the following link:  Directions