A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
A problem in computer numeric control (CNC) manufacturing is the minimization of the distance a drilling tool has to move in order to drill holes at given locations. After introducing the problem being an instance of the traveling salesman problem (TSP) we describe the Route Optimizer RO3 based on an evolutionary algorithm (EA). In experiments with real-world problem instances we were able to improve the results of RO3 by hybridization with the 2-opt heuristic to route lengths being 6% abovedoi:10.1109/cimca.2005.1631379 dblp:conf/cimca/SiglM05 fatcat:bi4clhc5l5bk7efpaawyapd4ma