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