← Back

ofxLaserTSP

github.com/Bryce-Summers/ofxLaserTSP · @Bryce-Summers
OF 0.9 Algorithms Geometry

Optimizes the traveling salesman problem for a set of double ended (Laser) paths.

3 3 Last commit 10y ago Created 10y ago

Forks

Forks pushed to more recently than Bryce-Summers/ofxLaserTSP itself, plus any admin-confirmed fork with commits of its own — worth checking if you're hitting issues with the original.

roymacdonald/ofxLaserTSP by @roymacdonald · ★ 0 · pushed 7y ago

README

ofxLaserTSP



Optimizes the traveling salesman problem for a set of double ended paths.

Status

Being tested in practice now.

Closed problem (Cycle).

alt text

Open problem (Path).

alt text

Please note that a solution to the open problem is simply a solution to the closed problem without its longest edge.

Future Work.

I've got a bunch of ideas for making this faster, more efficient, and working for larger problem sizes. Right now it is designed for the needs of those who have originally commissioned this work.

Get this addon

HTTPS
SSH