My entry into Reaktor's 2018 "Traveling Santa" competition. The goal is to minimize distance for visiting all nodes, but it differs from classic Traveling Salesman problem in that we can't fit all nodes into a single trip due to weight constraints (like a Knapsack problem).
My solution is a mix of heuristics (creating a "smart" route from scratch) and optimization (modifying an existing route).
Visualization credit to henkkuli.