A depot, a crowd of customers and a fleet of vehicles with a load limit. Every customer must be served once, and every kilometre costs money. Switch the algorithm and watch customers change vehicle. Drag, add or remove customers and the plans re-solve.