Solving Traveling Salesman Problems with Spacefilling Curves
Some combinatorial applications of spacefilling curves
I developed a spacefilling curve heuristic to solve routing challenges like the Traveling Salesman Problem efficiently. Unlike heavy optimization packages requiring massive computing power, this method generates near-optimal tours in seconds on standard hardware. We applied this approach to real-world logistics, including Meals-on-Wheels in Atlanta and blood delivery for the American Red Cross, proving its value in parallelizable, fast, and distance-free routing systems.
Use our heuristic and you get a route immediately, but you must travel for an extra month. Alternatively, configure a network of 110 processors and spend two months to compute the shortest route — to save a month of driving.