In several are routing problems, it is necessary to take turn penalties int
o account when designing a solution. Traditionally, this is done through a
transformation of the are routing problem into an equivalent vertex routing
problem. In this paper it is shown that a more direct approach, not resort
ing to such a transformation, may be more efficient.