Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs
This paper studies the Orthogonal Milling with Turn Costs. An exact algorithm is proposed based on an Integer Programming formulation of the problem. To our knowledge, this is the first exact algorithm ever proposed for the problem. Besides, a simple heuristic is also presented and an unprecedented experimentation involving these two algorithms and an existing approximation algorithm is carried out. We report and analyze the results obtained in these tests. Our benchmark instances are made public to allow for future comparisons.
Keywordsorthogonal milling with turn costs exact algorithms approximation algorithms heuristics experimental evaluation
Unable to display preview. Download preview PDF.
- 1.Arkin, E.M., Bender, M.A., Demaine, E., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 138–147 (2001)Google Scholar
- 2.Demaine, E.D., Mitchell, J.S.B., O’Rourke, J.: The open problems project. http://maven.smith.edu/~orourke/TOPP (page visited in January, 2011)
- 9.Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 283–319. Springer, US (2010)CrossRefGoogle Scholar