This uses a Genetic Algorithm for optimizing the traveling salesman problem for G0 (linear moves) commands in GCODE.
Simply upload a GCODE file and click Start/Restart, the program will loop and further optimize the hops between G0 points. When you are happy with the results, click Stop/Continue and then you can click Save Optimized GCODE to save the optimized file.
The program expects G0 commands to only happen above the material (when there is no cut happening).
It probably does not make sense to use this tool if you are cutting completely through the material unless you are using tabs on the outer cut of an object. Millcrum is a CAM tool which will add tabs to the path.
It was created by Andrew Hodel in 2015 based on the code cited in the paper (pdf) explaining the algorithm. There are some other projects that may interest you at http://xyzbots.com
how does the run-time and quality of the solution compare to metric_tsp_approx from the boost library? I did some simple tests with this boost library in 2011: http://www.anderswallin.net/2011/05/tsp/
I’m attempting to use this online tool, but after selecting a file to upload, it doesn’t actually upload it and when I then try to run the tool, it simply keeps showing the example.
Can you explain what causes this? Am I doing something wrong?
Hi @Sebastiaan! This is content that was imported to MakerForums from Google+ when Google shut down Google+ (thus the gplus label), and the user you are trying to converse with, @Andrew_Hodel, has not yet logged into Maker Forums, so he won’t get notification of your question, sadly.
That code looks pretty neat. I’ve always wanted to optimize my 3d print path, although there are added complications apart from optimizing travel time. Maybe I will get round to that someday.
