Experimental evaluation of algorithms for the orthogonal milling problem with turn costs

Authors:
Igor R. De Assis;Cid C. De Souza
Affiliations:
Institute of Computing, University of Campinas, Brazil;Institute of Computing, University of Campinas, Brazil
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 5
Cited 0

Optimal covering tours with turn costs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Directed Rural Postman Problem with Turn Penalties

Transportation Science
Graph Theory With Applications

Graph Theory With Applications
Optimal Covering Tours with Turn Costs

SIAM Journal on Computing
Transformations of generalized ATSP into ATSP

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.