What is the vehicle routing problem?
The vehicle routing problem is an optimization challenge with the goal of finding optimal routes for different vehicles visiting different locations.
Imagine you were a dispatcher and had to determine the order your driver should travel to five different customers. Easy, right? In fact, there are already 120 different solutions for this simple dispatching problem resulting in 120 possible combinations of multi-stop routes. If the number of customers triples to 15, the number of possible routes increases to an incredible 1.3 quadrillion.
This example is known as the "traveling salesman problem” (TSP), or in the transportation industry as the vehicle routing problem.