The Sweep Method


The CVRP model that we introduced in the previous notebook can take a lot of time to solve, especially in larger problem instances.

As was also the case with the TSP problem, in real-world applications we have no option but to use a heauristic approach. In this notebook we are going to implement the Sweep heuristic - a simple, geometric approach that can produce valid VRP solutions very quickly.

As it is a quite crude heuristic, these solutions are far from perfect, but can serve as a very good starting point.

We combine all nodes into a single list.